scientific article; zbMATH DE number 1559543

zbMath0962.68128MaRDI QIDQ4526992

Naoki Katoh, Takeshi Tokuyama, Tetsuo Asano, Hisao Tamaki

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time approximation scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (18)

Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem ⋮ Improved bounds for vehicle routing solutions ⋮ Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ The school bus problem on trees ⋮ Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces ⋮ Multi-shuttle crane scheduling in automated storage and retrieval systems ⋮ Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension ⋮ Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs

This page was built for publication: