Author:
Garg Naveen,Vazirani Vijay V.,Yannakakis Mihalis
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, “Proof verification and hardness of approximation problems”, Proceedings of 32nd IEEE Symposium on Foundations of Computer Science (1992), 14–23.
2. S. Chopra, M. R. Rao, “On the multiway cut polyhedron”, Networks 21 (1991), 51–89.
3. W. H. Cunningham (1991), “The optimal multiterminal cut problem”, DIMACS Series in Disc. Math. and Theor. Comput. Sci. 5 (1991), pp. 105–120.
4. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour and M. Yannakakis, “The complexity of multiway cuts”, Proceedings, 24th ACM Symposium on Theory of Computing (1992).
5. P. L. Erdos and L. A. Szekely, “Algorithms and min-max theorems for certain multiway cuts”, Proceedings Symposium on Integer Programming and Combinatorial Optimization (1992).
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献