Frederickson, Greg N. Approximation algorithms for some postman problems. (English) Zbl 0405.90076 J. Assoc. Comput. Mach. 26, 538-554 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 48 Documents MSC: 90C35 Programming involving graphs or networks 90C10 Integer programming 68Q25 Analysis of algorithms and problem complexity Keywords:Traveling Salesman Problem; Worst-Case Behavior; Estimation of Execution Time; Np-Complete Problem; Postman Problem; Heuristic Algorithm; Chinese Postman Problem; Rural Postman Problem Citations:Zbl 0391.90091 PDFBibTeX XMLCite \textit{G. N. Frederickson}, J. Assoc. Comput. Mach. 26, 538--554 (1979; Zbl 0405.90076) Full Text: DOI