A new view on rural postman based on eulerian extension and matching

  • Authors:

  • Manuel Sorge;René van Bevern;Rolf Niedermeier;Mathias Weller

  • Affiliations:

  • Institut für Softwaretechnik und Theoretische Informatik, TU, Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU, Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU, Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU, Berlin, Germany

  • Venue:
  • IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We provide a new characterization of the NP-hard arc routing problem Rural Postman in terms of a constrained variant of minimum-weight perfect matching on bipartite graphs. To this end, we employ a parameterized equivalence between Rural Postman and Eulerian Extension, a natural arc addition problem in directed multigraphs. We indicate the NP-hardness of the introduced matching problem. In particular, we use it to make some partial progress towards answering the open question about the parameterized complexity of Rural Postman with respect to the number of weakly connected components in the graph induced by the required arcs. This is a more than thirty years open and long-time neglected question with significant practical relevance.