Cover Image

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sitters, René
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 90 F.2; E.1; G.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)

The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
by: Jędrzejczak, Patryk, et al.
Published: (2025)

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
by: Neogi, Rian, et al.
Published: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
by: Ibrahimpur, Sharat, et al.
Published: (2025)

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
by: Krawczyk, Tomasz
Published: (2024)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
by: Alimi, Morteza, et al.
Published: (2025)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
by: Mukhopadhyay, Asish, et al.
Published: (2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

Optimal Preprocessing for Answering On-Line Product Queries
by: Alon, Noga, et al.
Published: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
by: Garg, Ishant
Published: (2026)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
by: Brodal, Gerth Stølting
Published: (2024)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
by: Krawczyk, Tomasz
Published: (2024)

An improved approximation algorithm for k-Median
by: Young, Neal E.
Published: (2025)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
by: Paszyński, Maciej
Published: (2024)

Loop unrolling of UCA models: distance labeling
by: Soulignac, Francisco J, et al.
Published: (2022)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
by: Diaby, Moustapha, et al.
Published: (2023)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

New Entropy Measures for Tries with Applications to the XBWT
by: Carfagna, Lorenzo, et al.
Published: (2025)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
by: Berger, Benjamin
Published: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
by: Dereniowski, Dariusz, et al.
Published: (2024)

Convergence analysis of t-SNE as a gradient flow for point cloud on a manifold
by: Jeong, Seonghyeon, et al.
Published: (2024)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
by: Klein, Kim-Manuel, et al.
Published: (2024)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
by: Blomer, Valentin, et al.
Published: (2026)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
by: Kumar, Nikhil, et al.
Published: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
by: Kumar, Nikhil, et al.
Published: (2025)

Backdoors for Quantified Boolean Formulas
by: Eriksson, Leif, et al.
Published: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
by: Dabrowski, Konrad K., et al.
Published: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
by: Gæde, Emil Toftegaard, et al.
Published: (2025)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
by: Flouro, Aaron R., et al.
Published: (2026)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

A (Weakly) Polynomial Algorithm for AIVF Coding
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)