A 3/2-Approximation algorithm for the mixed postman problem

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 4, 1999, Pages 425-433

  Raghavachari, Balaji ^a   Veerasamy, Jeyakesavan ^a,b  

^a The University of Texas at Dallas   (United States)

^b Samsung Telecommunications America   (United States)

Author keywords

Approximation algorithms; Chinese postman problem; Graphs; Mixed postman problem; NP completeness

Indexed keywords

EID: 1842637866     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197331454     Document Type: Article

References (18)

1. R. K. AHUJA, T. MAGNANTI, AND J. ORLIN, Network Flows, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. P. BRUCKER, The Chinese postman problem for mixed networks, in Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, Lecture Notes in Comput Sci. 100, Springer-Verlag, New York, 1980. pp. 354-366.
3. N. CHRISTOFIDES, E. BENAVENT, V. CAMPOS, A. CORBERAN, AND E. MOTA, An optimal method for the mixed postman problem, in System Modelling and Optimization, Lecture Notes in Control and Inform. Sci. 59, Springer, New York, 1984.
4. J. EDMONDS AND E. L. JOHNSON, Matching, Euler tours and the Chinese postman, Math. Programming, 5 (1973), pp. 88-124.
5. H. A. EISELT, Arc routing problems, Part I: The Chinese postman problem, Oper. Res., 43 (1995), pp. 231-242.
6. H. A. EISELT, Arc routing problems, Part II: The rural postman problem, Oper. Res., 43 (1995), pp. 399-414.
7. L. R. FORD AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
8. G. N. FREDERICKSON, Approximation algorithms for some postman problems, J. ACM, 26 (1979), pp. 538-554.
9. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., New York, 1979, p. 212.
10. M. GUAN, Graphic programming using odd and even points, Chinese Math., 1 (1962), pp. 273-277.
11. C. KAPPAUF AND G. KOEHLER, The mixed postman problem, Discrete Appl. Math., 1 (1979), pp. 89-103.
12. H. KARLOFF, Linear Programming, Birkhauser, Boston, MA, 1991.
13. G. L. NEMHAUSER AND L. A. WOLSEY, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988, pp. 648-651.
14. Y. NOBERT AND J. C. PICARD, An optimal algorithm for the mixed Chinese postman problem, Networks, 27 (1996), pp. 95-108.
15. C. H. PAPADIMITRIOU, On the complexity of edge traversing, J. ACM, 23 (1976), pp. 544-554.
16. W. L. PEARN, Solvable cases of the k-person Chinese postman problem, Oper. Res. Lett., 16 (1994), pp. 241-244.
17. W. L PEARN AND C. M. LIU. Algorithms for the Chinese postman problem on mixed networks, Comput. & Oper. Res., 22 (1995), pp. 479-489.
18. T. K. RALPHS, On the mixed Chinese postman problem, Oper. Res. Lett., 14 (1993), pp. 123-127.