An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[2] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[3] B. Rothschild,et al. On Two Commodity Network Flows , 1966, Oper. Res..
[4] J. Krivine,et al. Lois stables et espaces $L^p$ , 1967 .
[5] B. Rothschild,et al. MULTICOMMODITY NETWORK FLOWS. , 1969 .
[6] J. Wells,et al. Embeddings and Extensions in Analysis , 1975 .
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[9] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..
[10] Refael Hassin,et al. On multicommodity flows in planar graphs , 1984, Networks.
[11] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[12] 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.
[13] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[14] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[15] Alexander Schrijver,et al. Paths, Flows, and VLSI-Layout , 1990 .
[16] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[17] David Avis,et al. The cut cone, L1 embeddability, complexity, and multicommodity flows , 1991, Networks.
[18] Spyros Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flow and other techniques , 1991 .
[19] Mihalis Yannakakis,et al. The complexity of multiway cuts (extended abstract) , 1992, STOC '92.
[20] J. Matousek. Note on bi-Lipschitz embeddings into normed spaces , 1992 .
[21] M. Laurent,et al. Applications of cut polyhedra , 1992 .
[22] Éva Tardos,et al. Improved bounds on the max-flow min-cut ratio for multicommodity flows , 1993, Comb..
[23] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[24] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[25] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[26] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[27] Fillia Makedon,et al. Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..
[28] Mihalis Yannakakis,et al. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..
[29] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.