:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Singh, Priyanshu, Ahuja, Kapil
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Data Structures and Algorithms I.2; F.2
Online Access:	https://arxiv.org/abs/2501.02612
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the cohesion and separability of average-link for hierarchical agglomerative clustering
by: Laber, Eduardo Sany, et al.
Published: (2024)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)

Online Bin Packing with Predictions
by: Angelopoulos, Spyros, et al.
Published: (2021)

A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management
by: Ganesan, Ashwin
Published: (2026)

A High-Performance External Validity Index for Clustering with a Large Number of Clusters
by: Karbasian, Mohammad Yasin, et al.
Published: (2024)

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2024)

CART-ELC: Oblique Decision Tree Induction via Exhaustive Search
by: Laack, Andrew D.
Published: (2025)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
by: Gila, Ofek, et al.
Published: (2025)

Learning from Synthetic Data: Limitations of ERM
by: Amin, Kareem, et al.
Published: (2026)

Multi-View Stochastic Block Models
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Correlation Clustering with Vertex Splitting
by: Bentert, Matthias, et al.
Published: (2024)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
by: Shigemizu, Mika, et al.
Published: (2018)

Replicability in High Dimensional Statistics
by: Hopkins, Max, et al.
Published: (2024)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
by: Chen, Lin, et al.
Published: (2025)

Learning-Based TSP-Solvers Tend to Be Overly Greedy
by: Li, Xiayang, et al.
Published: (2025)

Clustering Permutations: New Techniques with Streaming Applications
by: Chakraborty, Diptarka, et al.
Published: (2022)

$XX^{t}$ Can Be Faster
by: Rybin, Dmitry, et al.
Published: (2025)

NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)

A $2$-branching construction for the $χ\leq 2r$ bound
by: Date, Vinicius Tikara Venturi, et al.
Published: (2026)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
by: Antoniadis, Antonios, et al.
Published: (2020)

Contraction Clustering (RASTER): A Very Fast Big Data Algorithm for Sequential and Parallel Density-Based Clustering in Linear Time, Constant Memory, and a Single Pass
by: Ulm, Gregor, et al.
Published: (2019)

Perturb-and-Project: Differentially Private Similarities and Marginals
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)

The Presort Hierarchy for Geometric Problems
by: van der Hoog, Ivor, et al.
Published: (2026)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
by: Wang, Xin, et al.
Published: (2025)

Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
by: Awofeso, Christine, et al.
Published: (2025)

Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
by: Emmerich, Michael
Published: (2025)

Hierarchical Exponential Search Via K-Spines
by: Dong, Bob
Published: (2025)

Simple in-place yet comparison-optimal Mergesort
by: Siebert, Christian
Published: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
by: Amouzandeh, Aflatoun, et al.
Published: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
by: Hommelsheim, Felix, et al.
Published: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
by: Bouchard, Sébastien, et al.
Published: (2025)