Author:
Bläser Markus,Manthey Bodo
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoret. Comput. Sci., 237(1–2):123–134, 2000.
3. Lect Notes Comput Sci;M. Bläser,2001
4. G. P. Cornuéjols and W. R. Pulleyblank. A matching problem with side conditions. Discrete Math., 29:135–159, 1980.
5. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:449–467, 1965.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献