The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable Full article

Journal

Operations Research Letters
ISSN: 0167-6377

Output data

Year: 2021, Volume: 49, Number: 2, Pages: 270-277 Pages count : 8 DOI: 10.1016/j.orl.2021.01.017

Tags

Approximation algorithm; Arc routing; Fixed-parameter algorithm; NP-hardness; Rural Postman Problem; Temporal graphs

Authors

Afanasev Vsevolod A. ² , van Bevern René ² , Tsidulko Oxana Yu. ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Afanasev V.A. , van Bevern R. , Tsidulko O.Y.
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable
Operations Research Letters. 2021. V.49. N2. P.270-277. DOI: 10.1016/j.orl.2021.01.017 WOS Scopus OpenAlex

Web of science:	WOS:000624944700022
Scopus:	2-s2.0-85100767856
OpenAlex:	W3128828969

DB	Citing
Scopus	6
Web of science	6
OpenAlex	6