A New View on Rural Postman Based on Eulerian Extension and Matching

DOI10.1007/978-3-642-25011-8_25zbMath1344.68091OpenAlexW2176963293MaRDI QIDQ3111660

Rolf Niedermeier, Mathias Weller, René van Bevern, Manuel Sorge

Publication date: 13 January 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_25

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Rural postman parameterized by the number of components of required edges ⋮ A new view on rural postman based on Eulerian extension and matching ⋮ From Few Components to an Eulerian Graph by Adding Arcs

This page was built for publication: A New View on Rural Postman Based on Eulerian Extension and Matching