Cover Image

Online sorting and online TSP: randomized, stochastic, and high-dimensional

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abrahamsen, Mikkel, Bercea, Ioana O., Beretta, Lorenzo, Klausen, Jonas, Kozma, László
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
by: Abrahamsen, Mikkel
Published: (2024)

Hashing for Sampling-Based Estimation
by: Aamand, Anders, et al.
Published: (2024)

Fast and simple multiplication of bounded twin-width matrices
by: Kozma, László, et al.
Published: (2026)

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
by: Abrahamsen, Mikkel, et al.
Published: (2020)

Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)

Theoretical Analysis of Byte-Pair Encoding
by: Kozma, László, et al.
Published: (2024)

A Faster Algorithm for Constrained Correlation Clustering
by: Fischer, Nick, et al.
Published: (2025)

Compact representations of pattern-avoiding permutations
by: Kozma, László, et al.
Published: (2025)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
by: Kisfaludi-Bak, Sándor, et al.
Published: (2020)

Lower bounds for the universal TSP on the plane
by: Kravaris, Cosmas
Published: (2024)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
by: Gaudio, Julia, et al.
Published: (2026)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
by: Hu, Jialu, et al.
Published: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
by: Austrin, Per, et al.
Published: (2024)

Online Algorithms for Geometric Independent Set
by: De, Minati, et al.
Published: (2026)

Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)

Euclidean distance compression via deep random features
by: Leroux, Brett, et al.
Published: (2024)

Online Metric TSP
by: Bertram, Christian
Published: (2025)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
by: Bhore, Sujoy, et al.
Published: (2026)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
by: Bhore, Sujoy, et al.
Published: (2023)

Aleph Filter: To Infinity in Constant Time
by: Dayan, Niv, et al.
Published: (2024)

Waiting is not easy but worth it: the online TSP on the line revisited
by: Chen, Pei-Chuan, et al.
Published: (2019)

Optimization with pattern-avoiding input
by: Berendsohn, Benjamin Aram, et al.
Published: (2023)

New Statistical and Computational Results for Learning Junta Distributions
by: Beretta, Lorenzo
Published: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
by: Kalavas, Andreas, et al.
Published: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
by: Kalavas, Andreas, et al.
Published: (2025)

Daisy Bloom Filters
by: Bercea, Ioana O., et al.
Published: (2022)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)

Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
by: Kakimura, Naonori, et al.
Published: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
by: Lokshtanov, Daniel, et al.
Published: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
by: Bhore, Sujoy, et al.
Published: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
by: Ebbens, Matthijs, et al.
Published: (2024)

Extraction Theorems With Small Extraction Numbers
by: Agarwal, Arjun, et al.
Published: (2024)

Fréchet Distance in Subquadratic Time
by: Cheng, Siu-Wing, et al.
Published: (2024)

Computing largest minimum color-spanning intervals of imprecise points
by: Acharyya, Ankush, et al.
Published: (2024)