Author:
Gutin Gregory,Jones Mark,Sheng Bin
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer (2009)
2. van Bevern, R., Niedermeier, R., Sorge, M., Weller, M.: Complexity of Arc Rooting Problems. In: Corberán, A., Laporte, G. (eds.) Arc Routing: Problems, Methods and Applications, ch. 2. SIAM, Phil
3. Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)
4. LNCS;P. Brucker,1981
5. Christofides, N.: The optimum traversal of a graph. Omega 1, 719–732 (1973)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献