AlgorithmPapers's profile picture. Covers data structures and analysis of algorithms.
New submissions to http://arxiv.org (not affiliated with arXiv)

Data Structures and Algorithms Papers

@AlgorithmPapers

Covers data structures and analysis of algorithms. New submissions to http://arxiv.org (not affiliated with arXiv)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams. arxiv.org/abs/2510.18180


Online Randomness Extraction: Simulating Barely Random Algorithms in the Random Order Arrival Model. arxiv.org/abs/2510.18049


Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset. arxiv.org/abs/2510.17888


The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions. arxiv.org/abs/2510.17714


Near-Optimal Property Testers for Pattern Matching. arxiv.org/abs/2510.17645


Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap. arxiv.org/abs/2510.17595


On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers. arxiv.org/abs/2510.17344


Finding 4-Additive Spanners: Faster, Stronger, and Simpler. arxiv.org/abs/2510.17262


Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs. arxiv.org/abs/2510.17182


All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries. arxiv.org/abs/2510.16741


An Exact Algorithm for the Unanimous Vote Problem. arxiv.org/abs/2510.16678


Online computation of normalized substring complexity. arxiv.org/abs/2510.16454


Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance. arxiv.org/abs/2510.16351


A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates. arxiv.org/abs/2510.16336


Near-linear time subhypergraph counting in bounded degeneracy hypergraphs. arxiv.org/abs/2510.16330


Loading...

Something went wrong.


Something went wrong.