Author:
Müller-Hannemann Matthias,Weihe Karsten
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. F. Barahona. Planar multicommodity flows, max cut and the Chinese postman problem. In W. Cook and P. D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 1, pages 189–202. American Mathematical Society, Providence, RI, 1990.
2. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In D.-Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, 2nd Edition, pages 47–123. World Scientific, Singapore, 1995.
3. U. Derigs. Programming in networks and graphs: on the combinatorial background and near-equivalence of network flow and matching algorithms. Springer, 1988.
4. J. Edmonds and E.L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5:88–124, 1973.
5. H. Everett, W. Lenhart, M. Overmars, T. Shermer, and J. Urrutia. Strictly convex quadrilateralizations of polygons. In Proceedings Fourth Canadian Conference on Computational Geometry, pages 77–83, 1992.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献