Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. EDMONDS, J., The Chinese Postman Problem. Operations Research 13, Supplement 1 (1965), B73–B77.
2. EDMONDS, J. and JOHNSON, E.L., Matching, Euler Tours and the Chinese Postman. Mathematical Programming 5 (1973), 88–124.
3. FREDERICKSON, G.N., Approximation Algorithms for Some Postman Problems. JACM 26 (1979), 538–554.
4. FREDERICKSON, G.N., HECHT, M.S., and KIM, C.E., Approximation Algorithms for Some Routing Problems. Siam Journal of Computing 7 (1978), 178–193.
5. LAWLER, E.L., Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York (1976).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献