From Few Components to an Eulerian Graph by Adding Arcs
From MaRDI portal
Publication:3104786
DOI10.1007/978-3-642-25870-1_28zbMath1341.05144OpenAlexW24573320MaRDI QIDQ3104786
Rolf Niedermeier, René van Bevern, Manuel Sorge, Mathias Weller
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_28
Related Items (9)
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ Rural postman parameterized by the number of components of required edges ⋮ A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem ⋮ Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ Parameterized complexity of \(k\)-Chinese postman problem ⋮ A new view on rural postman based on Eulerian extension and matching ⋮ Parameterized algorithms and data reduction for the short secluded s‐t‐path problem ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ A survey of parameterized algorithms and the complexity of edge modification
Cites Work
- Unnamed Item
- On problems without polynomial kernels
- On Eulerian extensions and their application to no-wait flowshop scheduling
- Efficient Algorithms for Eulerian Extension
- A New View on Rural Postman Based on Eulerian Extension and Matching
- Incompressibility through Colors and IDs
- On general routing problems
- On general routing problems: Comments
- A fundamental problem in vehicle routing
- Approximation Algorithms for Some Postman Problems
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- Arc Routing Problems, Part II: The Rural Postman Problem
This page was built for publication: From Few Components to an Eulerian Graph by Adding Arcs
