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

Vsevolod A. Afanasev, René van Bevern, Oxana Yu Tsidulko

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)270-277
Number of pages8
JournalOperations Research Letters
Volume49
Issue number2
DOIs
Publication statusPublished - Mar 2021

Keywords

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

OECD FOS+WOS

  • 1.02 COMPUTER AND INFORMATION SCIENCES
  • 5.02 ECONOMICS AND BUSINESS
  • 2.02 ELECTRICAL ENG, ELECTRONIC ENG
  • 2.02.IQ ENGINEERING, ELECTRICAL & ELECTRONIC
  • 1.02.EW COMPUTER SCIENCE, SOFTWARE ENGINEERING
  • 5.02.PE OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Fingerprint

Dive into the research topics of 'The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable'. Together they form a unique fingerprint.

Cite this