Cover Image

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Chen, Yongyu
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Discrete Mathematics F.2.0; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Approximation of Fractional Hypertree Width
by: Korchemna, Viktoriia, et al.
Published: (2024)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)

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

Approximation Algorithms for Correlated Knapsack Orienteering
by: Espinosa, David Aleman, et al.
Published: (2024)

A polynomial-time algorithm for recognizing high-bandwidth graphs
by: Varona, Luis M. B.
Published: (2026)

Deterministic Minimum Steiner Cut in Maximum Flow Time
by: Ding, Matthew, et al.
Published: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
by: Ma, Will, et al.
Published: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)

Better Approximation for Weighted $k$-Matroid Intersection
by: Singer, Neta, et al.
Published: (2024)

Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
by: Jacob, Ashwin, et al.
Published: (2026)

Faster algorithms on linear delta-matroids
by: Koana, Tomohiro, et al.
Published: (2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
by: Nishimura, Yuki, et al.
Published: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
by: Kavi, Nithin
Published: (2024)

Searching in trees with $k$-up-modular cost functions
by: Szyfelbein, Michał
Published: (2025)

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

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

A Decomposition Approach to the Weighted $k$-server Problem
by: Ayyadevara, Nikhil, et al.
Published: (2024)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
by: Shalaby, Ahmed, et al.
Published: (2024)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
by: Chauhan, Archit, et al.
Published: (2026)

Computing parameters that generalize interval graphs using restricted modular partitions
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Faster Mixing for Triangulations via Transport Flows
by: Alev, Vedat Levi, et al.
Published: (2026)

Weisfeiler-Leman on graphs of small twin-width
by: Heinrich, Irene, et al.
Published: (2026)

Optimal distance query reconstruction for graphs without long induced cycles
by: Bastide, Paul, et al.
Published: (2023)

Lower Bounds for Leaf Rank of Leaf Powers
by: Høgemo, Svein
Published: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
by: Bourneuf, Romain, et al.
Published: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
by: Sun, Hao
Published: (2023)

Fairness in the k-Server Problem
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2025)

Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors
by: Sule, Virendra
Published: (2025)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Prophet Inequalities: Separating Random Order from Order Selection
by: Giambartolomei, Giordano, et al.
Published: (2023)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
by: Giambartolomei, Giordano, et al.
Published: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Arborescences and Shortest Path Trees when Colors Matter
by: Ardra, P. S., et al.
Published: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)