The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
PTAS for k-tour cover problem on the plane for moderately large values of k
[article]
2009
arXiv
pre-print
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem), the goal is to minimize the total length of tours that cover all points in P, such that each tour starts and ends in O and covers at most k points from P. The k-tour cover problem is known to be NP-hard. It is also known to admit constant factor approximation algorithms for all values of k and even a
arXiv:0904.2576v1
fatcat:mch4lnorqvaenbx65sr2q7qu3i