Approximation algorithms for the mixed postman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 169-179

  Raghavachari, Balaji ^a   Veerasamy, Jeyakesavan ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

CHINESE POSTMAN PROBLEM; DIRECTED EDGES; MIXED GRAPH; NP-HARD; PERFORMANCE RATIO; POLYNOMIAL-TIME; POSTMAN PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 84958741960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_13     Document Type: Conference Paper

References (16)

1. P. Brucker. The Chinese postman problem for mixed networks. In Proceedings of the International Workshop on Graph Theoretic Concepts in Computer Science, LNCS, Vol. 100, pages 354-366. Springer, 1980
2. N. Christofides, E. Benavent, V. Campos, A. Corberan, and E. Mota. An optimal method for the mixed postman problem. In System Modelling and Optimization, Notes in Control and Information Sciences, Vol. 59. Springer, 1984
3. J. Edmonds and E. L. Johnson. Matching, Euler tours and the Chinese postman. Math. Programming, 5:88-124, 1973
4. H. A. Eiselt. Arc routing problems, Part I: The Chinese postman problem. Oper- ations Research, 43:231-242, 1995
5. H. A. Eiselt. Arc routing problems, Part II: The rural postman problem. Operations Research, 43:399-414, 1995
6. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton U. Press, Princeton, NJ, 1962
7. G. N. Frederickson. Approximation algorithms for some postman problems. J. Assoc. Comput. Mach., 26:538-554, 1979
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979
9. M. Guan. Graphic programming using odd and even points. Chinese Math., 1:273-277, 1962
10. C. H. Kappauf and G. J. Koehler. The mixed postman problem. Discret. Appl. Math., 1:89-103, 1979
11. Y. Nobert and J. C. Picard. An optimal algorithm for the mixed Chinese postman problem. Publication # 799. Centre de recherche sur les transports, Montreal, Canada, 1991
12. Y. Nobert and J. C. Picard. An optimal algorithm for the mixed Chinese postman problem. Networks, 27:95-108, 1996
13. C. H. Papadimitriou. On the complexity of edge traversing. J. Assoc. Comput. Mach., 23:544-554, 1976
14. W. L. Pearn. Solvable cases of the k-person Chinese postman problem. Operations Research Letters, 16:241-244, 1994
15. W. L. Pearn and C. M. Liu. Algorithms for the Chinese postman problem on mixed networks. Computers & Operations Research, 22:479-489, 1995
16. T. K. Ralphs. On the mixed Chinese postman problem. Operations Research Letters, 14:123-127, 1993.