Abstract
Abstract
We introduce the Chinese deliveryman problem where the goal of the deliveryman is to visit every house in his neighborhood such that the average time of arrival is minimized. We show that, in contrast to the well-known Chinese postman problem, the Chinese deliveryman problem is APX-hard in general and NP-hard for planar graphs. We give a simple $$\sqrt{2}$$
2
-approximation for undirected graphs and a 4 / 3-approximation for 2-edge connected graphs. We observe that there is a PTAS for planar graphs and that depth first search is optimal for trees.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference25 articles.
1. Arora S, Karakostas G (2003) Approximation schemes for minimum latency problems. SIAM J Comput 32:1317–1337
2. Arora S, Safra S (1998) Probabilistic checking of proofs: a new characterization of NP. J ACM 45:70–122
3. Arora S, Lund C, Motwani R, Sudan M, Szegedy M (1998a) Proof verification and the hardness of approximation problems. J ACM 45:501–555
4. Arora S, Grigni M, Karger D, Klein P, Woloszyn A (1998b) A polynomial time approximation scheme for weighted planar graph TSP. In: 9th ACM–SIAM symposium on discrete algorithms, pp 33–41
5. Baston V, Beck A (1995) Generalizations in the linear search problem. Israel J Math 90:301–323
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献