Author:
Cunningham William H.,Tang Lawrence
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. G. Călinescu, H. Karloff, and Y. Rabani: An improved approximation algorithm for MULTIWAY CUT Proceedings of Symposium on Theory of Computing, ACM, 1998.
2. Kevin Cheung, private communication, 1999.
3. S. Chopra and M.R. Rao, “On the multiway cut polyhedron”, Networks 21(1991), 51–89.
4. W.H. Cunningham, “The optimal multiterminal cut problem”, in: C. Monma and F. Hwang (eds.), Reliability of Computer and Communications Networks, American Math. Soc., 1991, pp. 105–120.
5. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis, “The Complexity of multiway cuts”, extended abstract, 1983.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献