Author:
Bertsimas Dimitris,Teo Chungpiaw,Vohra Rakesh
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. C. Berge and V. Chvátal (eds), Topics on Perfect graphs, Annals of Discrete Mathematics, 21, 1984.
2. S. Chopra and L.H. Owen, Extended formulations for the A-cut problem, preprint, 1994.
3. S. Chopra and M.R. Rao, On the multiway cut polyhedron, Networks, 21, 51–89, 1991.
4. W.H. Cunningham, The optimal multiterminal cut problem, DIMACS series in Discrete Mathematics and Theoretical Computer Science, 5, 105–120, 1991.
5. E. Dalhaus, D. Johnson, C. Papadimitriou, P. Seymour and M. Yannakakis, The complexity of the multiway cuts, 24th Annual ACM STOC, 241–251, 1992.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献