The complexity of multiway cuts (extended abstract)
暂无分享,去创建一个
Mihalis Yannakakis | Christos H. Papadimitriou | David S. Johnson | Paul Seymour | E. Dahlhaus | David S. Johnson | M. Yannakakis | C. Papadimitriou | P. Seymour | E. Dahlhaus
[1] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[2] David S. Johnson,et al. Stockmeyer: some simplified np-complete graph problems , 1976 .
[3] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[6] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[7] Mihalis Yannakakis,et al. Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) , 1983, ICALP.
[8] D. Hochbaum,et al. An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem , 1985 .
[9] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[10] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..
[11] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[12] Dorit S. Hochbaum,et al. Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[13] William H. Cunningham. The Optimal Multiterminal Cut Problem , 1989, Reliability Of Computer And Communication Networks.
[14] M. R. Rao,et al. On the multiway cut polyhedron , 1991, Networks.
[15] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[16] Vijay V. Vazirani,et al. Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[17] P. Erdös,et al. Evolutionary trees: An integer multicommodity max-flow-min-cut theorem , 1992 .