Approximation Algorithms for Some Postman Problems

@article{Frederickson1979ApproximationAF,
  title={Approximation Algorithms for Some Postman Problems},
  author={Greg N. Frederickson},
  journal={J. ACM},
  year={1979},
  volume={26},
  pages={538-554}
}
Approxtmatton algorithms for several NP-complete edge-covermg routing problems are presented and analyzed m terms of the worst-case ratio of the cost of the obtained solutmn to the cost of the opt imum solutton A worst-case bound of 2 is proved for the mixed postman algortthm of Edmonds and Johnson, and a related algorithm for the mixed postman problem is shown also to have a worst-case bound of 2 A mixed strategy approach ts used to obtain a bound of ~ for the mixed postman problem A second… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 81 CITATIONS, ESTIMATED 92% COVERAGE

Graph planning for environmental coverage

VIEW 21 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Tool-Path Optimization using Neural Networks

  • 2019 IEEE International Symposium on Circuits and Systems (ISCAS)
  • 2019
VIEW 13 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Improved solutions for the Chinese postman problem on mixed networks

  • Computers & OR
  • 1999
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Approximation Algorithms for the Mixed Postman Problem

VIEW 14 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1979
2019

CITATION STATISTICS

  • 30 Highly Influenced Citations

Similar Papers

Loading similar papers…