The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable |
scientific article; zbMATH DE number 7331265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable |
scientific article; zbMATH DE number 7331265 |
Statements
The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (English)
0 references
7 April 2021
0 references
approximation algorithm
0 references
fixed-parameter algorithm
0 references
NP-hardness
0 references
arc routing
0 references
rural postman problem
0 references
temporal graphs
0 references
0 references
