The chinese postman problem for mixed graphs
After introducing the concept of augmentations of graphs a survey is given of results for the Chinese postman problem for mixed graphs and related problems. Also complexity results and approximation algorithms for these problems are discussed.
KeywordsApproximation Algorithm Minimal Cost Undirected Graph Network Flow Problem Cost Match
Unable to display preview. Download preview PDF.
- EDMONDS, J., The Chinese Postman Problem. Operations Research 13, Supplement 1 (1965), B73–B77.Google Scholar
- EDMONDS, J. and JOHNSON, E.L., Matching, Euler Tours and the Chinese Postman. Mathematical Programming 5 (1973), 88–124.Google Scholar
- FREDERICKSON, G.N., Approximation Algorithms for Some Postman Problems. JACM 26 (1979), 538–554.Google Scholar
- FREDERICKSON, G.N., HECHT, M.S., and KIM, C.E., Approximation Algorithms for Some Routing Problems. Siam Journal of Computing 7 (1978), 178–193.Google Scholar
- LAWLER, E.L., Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York (1976).Google Scholar
- LENSTRA, J.K., and RINNOOY KAN, A.H.G., On General Routing Problems. Networks 6 (1976), 273–280.Google Scholar
- MEI — KO K., Graphic Programming Using Odd or Even Points. Chinese Mathematics 1 (1962), 237–277.Google Scholar
- MINIEKA, E., The Chinese Postman Problem for Mixed Networks. Management Science 25 (1979), 643–648.Google Scholar
- ORLOFF, C.S., A Fundamental Problem in Vehicle Routing. Networks 4 (1974), 35–64.Google Scholar
- ORLOFF, C.S., On General Routing Problems: Comments. Networks 6 (1976), 281–284.Google Scholar
- PAPADIMITRIOU, C.H., On the Complexity of Edge Traversing. JACM 23 (1976), 544–554.Google Scholar