Efficient Algorithms for Eulerian Extension and Rural Postman

@article{Dorn2013EfficientAF,
  title={Efficient Algorithms for Eulerian Extension and Rural Postman},
  author={Frederic Dorn and Hannes Moser and Rolf Niedermeier and Mathias Weller},
  journal={SIAM J. Discrete Math.},
  year={2013},
  volume={27},
  pages={75-94}
}
The aim of directed Eulerian extension problems is to make a given directed, possibly arc-weighted, (multi-)graph Eulerian by adding a minimum-cost set of arcs. These problems have natural applications in scheduling and arc routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard WeightedMultigraph Eulerian Extension problem is fixed-parameter tractable with respect to the number k of extension arcs. For a directed, n-vertex… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

Ordering Protein Contact Matrices

Computational and structural biotechnology journal • 2018
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Similar Papers

Loading similar papers…