Highly Influenced

3 Excerpts

@inproceedings{Nagarajan2006MinimumVR, title={Minimum Vehicle Routing with a Common Deadline}, author={Viswanath Nagarajan and R. Ravi}, booktitle={APPROX-RANDOM}, year={2006} }

- Published in APPROX-RANDOM 2006
DOI:10.1007/11830924_21

In this paper, we study the following vehicle routing problem: given n vertices in a metric space, a specified root vertex r (the depot), and a length bound D, find a minimum cardinality set of r-paths that covers all vertices, such that each path has length at most D. This problem is NP-complete, even when the underlying metric is induced by a weighted star. We present a 4-approximation for this problem on tree metrics. On general metrics, we obtain an O(log D) approximation algorithm, and… CONTINUE READING