Approximation Algorithms for Requirement Cut on Graphs
暂无分享,去创建一个
[1] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[2] Vijay V. Vazirani,et al. Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..
[3] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[4] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[5] Philip N. Klein,et al. Approximation Algorithms for Steiner and Directed Multicuts , 1997, J. Algorithms.
[6] Aravind Srinivasan,et al. Approximation algorithms for the covering Steiner problem , 2002, Random Struct. Algorithms.
[7] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[8] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[9] Mikkel Thorup,et al. Rounding algorithms for a geometric embedding of minimum multiway cut , 1999, STOC '99.
[10] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[11] Mihalis Yannakakis,et al. Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..
[12] Michael Langberg,et al. The multi-multiway cut problem , 2004, Theor. Comput. Sci..
[13] R. Ravi,et al. A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees , 1992, J. Algorithms.
[14] Éva Tardos,et al. Improved bounds on the max-flow min-cut ratio for multicommodity flows , 1993, Comb..