Approximating the k-multicut problem
暂无分享,去创建一个
[1] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.
[2] Chandra Chekuri,et al. Multicommodity Demand Flow in a Tree , 2003, ICALP.
[3] V. Rich. Personal communication , 1989, Nature.
[4] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.
[5] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[6] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[7] Refael Hassin,et al. Rounding to an Integral Program , 2005, WEA.
[8] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[9] 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.
[10] Dorit S. Hochbaum. Instant Recognition of Half Integrality and 2-Approximations , 1998, APPROX.
[11] R. Ravi,et al. The Constrained Minimum Spanning Tree Problem (Extended Abstract) , 1996, SWAT.
[12] Noga Alon,et al. A general approach to online network optimization problems , 2004, SODA '04.
[13] Danny Segev,et al. Partial multicuts in trees , 2006, Theor. Comput. Sci..
[14] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[15] Naveen Garg,et al. Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.
[16] Clifford Stein,et al. Approximation Algorithms for Single-Source Unsplittable Flow , 2001, SIAM J. Comput..
[17] Mihalis Yannakakis,et al. Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..
[18] Vijay V. Vazirani,et al. Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[19] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[20] Chandra Chekuri,et al. Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.
[21] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[22] Rajiv Gandhi,et al. Approximation algorithms for partial covering problems , 2004, J. Algorithms.
[23] David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
[24] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.