eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-09-14
130
143
10.4230/OASIcs.ATMOS.2015.130
article
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
van Bevern, René
Komusiewicz, Christian
Sorge, Manuel
We show that any alpha(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson problem yields O(alpha(C))-approximation algorithms for various mixed, windy, and capacitated arc routing problems. Herein, C is the number of weakly-connected components in the subgraph induced by the positive-demand arcs, a number that can be expected to be small in applications. In conjunction with known results, we derive constant-factor approximations if C is in O(log n) and O(log(C)/log(log(C)))-approximations in general.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol048_atmos2015/OASIcs.ATMOS.2015.130/OASIcs.ATMOS.2015.130.pdf
vehicle routing
transportation
Rural Postman
Chinese Postman
NP- hard problem
parameterized algorithm
combinatorial optimization