Name
Title | ||
|---|---|---|
The Hierarchical Chinese Postman Problem: The Slightest Disorder Makes It Hard, Yet Disconnectedness Is Manageable |
Abstract | ||
|---|---|---|
The Hierarchical Chinese Postman Problem is finding a shortest traversal of all edges of a graph respecting precedence constraints given by a partial order on classes of edges. We show that the special case with connected classes is NP-hard even on orders decomposable into a chain and an incomparable class. For the case with linearly ordered (possibly disconnected) classes, we get 5/3-approximations and fixed-parameter algorithms by transferring results from the Rural Postman Problem. (C) 2021 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.orl.2021.01.017 | OPERATIONS RESEARCH LETTERS |
Keywords | DocType | Volume |
Approximation algorithm, Fixed-parameter algorithm, NP-hardness, Arc routing, Rural Postman Problem, Temporal graphs | Journal | 49 |
Issue | ISSN | Citations |
2 | 0167-6377 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vsevolod A. Afanasev | 1 | 0 | 0.34 |
| René van Bevern | 2 | 126 | 19.33 |
| O. Yu. Tsidulko | 3 | 1 | 2.85 |