2019
DOI: 10.1007/s10288-019-00420-2
|View full text |Cite
|
Sign up to set email alerts
|

The Chinese deliveryman problem

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 √ 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 sear… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 24 publications
(23 reference statements)
0
0
0
Order By: Relevance