Image de couverture de livre

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhao, Jingyang, Xiao, Mingyu
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
par: Zhao, Jingyang, et autres
Publié: (2023)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
par: Zhao, Jingyang, et autres
Publié: (2022)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

Improved Approximations for Dial-a-Ride Problems
par: Zhao, Jingyang, et autres
Publié: (2026)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
par: Zhao, Jingyang, et autres
Publié: (2023)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

The APX-hardness of the Traveling Tournament Problem
par: Zhao, Jingyang, et autres
Publié: (2023)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
par: Zhao, Jingyang, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
par: Friggstad, Zachary, et autres
Publié: (2025)

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
par: Xie, Ningyi, et autres
Publié: (2023)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
par: Ganian, Robert, et autres
Publié: (2024)

Unsplittable Flow on a Short Path
par: Doron-Arad, Ilan, et autres
Publié: (2024)

On the Approximability of Unsplittable Flow on a Path with Time Windows
par: Armbruster, Alexander, et autres
Publié: (2025)

Unsplittable Transshipments
par: Debgupta, Srinwanti, et autres
Publié: (2026)

Integer and Unsplittable Multiflows in Series-Parallel Digraphs
par: Almoghrabi, Mohammed Majthoub, et autres
Publié: (2024)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
par: Chen, Yongyu
Publié: (2023)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
par: Ferreira, Miguel, et autres
Publié: (2025)

FPT Approximation for Capacitated Sum of Radii
par: Jaiswal, Ragesh, et autres
Publié: (2024)

Approximating Optimum Online for Capacitated Resource Allocation
par: Braun, Alexander, et autres
Publié: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
par: Swamy, Chaitanya, et autres
Publié: (2025)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
par: Gibbons, Ethan, et autres
Publié: (2026)

Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements
par: Yamano, Ryosuke, et autres
Publié: (2026)

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
par: Bläsius, Thomas, et autres
Publié: (2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
par: Bhaskar, Umang, et autres
Publié: (2025)

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing
par: Uroić, Leon Stjepan, et autres
Publié: (2026)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
par: Blauth, Jannis, et autres
Publié: (2022)

The En Route Truck-Drone Delivery Problem
par: Krizanc, Danny, et autres
Publié: (2024)

Linear Kernels for $l$-Exact Component Order Connectivity
par: Liu, Yuxi, et autres
Publié: (2026)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
par: Tian, Kangyi, et autres
Publié: (2026)

A Refined Kernel for $d$-Hitting Set
par: Liu, Yuxi, et autres
Publié: (2025)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
par: Bai, Tian, et autres
Publié: (2022)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
par: Xiong, Ziliang, et autres
Publié: (2024)