PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k

DOI10.1007/978-3-642-10631-6_100zbMath1273.68404OpenAlexW2065154034WikidataQ58203700 ScholiaQ58203700MaRDI QIDQ3652286

Anna Adamaszek, Artur Czumaj, Andrzej Lingas

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_100

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (6)

Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem ⋮ Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ The school bus problem on trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs

This page was built for publication: PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k