Approximation Algorithms for Some Postman Problems
Journal of the ACM (JACM)
Approximation algorithms for np-hard routing problems.
Approximation algorithms for np-hard routing problems.
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
A Solution to the Rural Postman Problem Based on Artificial Ant Colonies
Current Topics in Artificial Intelligence
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Vehicle Routing for Urban Snow Plowing Operations
Transportation Science
New heuristic algorithms for the windy rural postman problem
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Efficient algorithms for Eulerian extension
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms
A new view on rural postman based on eulerian extension and matching
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
From few components to an eulerian graph by adding arcs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Note: Parameterized complexity of k-Chinese Postman Problem
Theoretical Computer Science
Hi-index | 0.00 |
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 the matching problem to make partial progress towards answering the open question about the parameterized complexity of Rural Postman with respect to the parameter ''number of weakly connected components in the graph induced by the required arcs''. This is a more than thirty years open and long-neglected question with significant practical relevance.