Pruning 2-Connected Graphs
暂无分享,去创建一个
[1] Santosh S. Vempala,et al. A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..
[2] Satish Rao,et al. Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[3] Santosh S. Vempala,et al. New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..
[4] Bundit Laekhanukit,et al. An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem , 2008, STOC '08.
[5] Santosh S. Vempala,et al. A constant-factor approximation algorithm for the k MST problem (extended abstract) , 1996, STOC '96.
[6] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[7] Naveen Garg,et al. A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[8] Guy Kortsarz,et al. Approximating Minimum-Cost Connectivity Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.
[9] David P. Williamson,et al. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..
[10] Paul D. Seymour,et al. Nowhere-zero 6-flows , 1981, J. Comb. Theory, Ser. B.
[11] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.
[12] Mohit Singh,et al. Survivable network design with degree or order constraints , 2007, STOC '07.
[13] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[14] Mohammad Taghi Hajiaghayi,et al. The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema , 2006, SODA '06.
[15] David P. Williamson,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[16] Adam Meyerson,et al. Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.
[17] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[18] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[19] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[20] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[21] Tim Roughgarden,et al. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..
[22] Mohammad Taghi Hajiaghayi,et al. Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design , 2010, SIAM J. Comput..
[23] Mohammad Taghi Hajiaghayi,et al. Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[24] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[25] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[26] Chandra Chekuri,et al. Improved algorithms for orienteering and related problems , 2008, SODA '08.
[27] Naveen Garg,et al. Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.
[28] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.
[29] Kamal Jain,et al. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[30] David R. Karger,et al. Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[31] Mohammad R. Salavatipour,et al. A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs , 2008, APPROX-RANDOM.
[32] Mohammad Taghi Hajiaghayi,et al. Approximation algorithms for node-weighted buy-at-bulk network design , 2007, SODA '07.
[33] Joseph Cheriyan,et al. Approximating minimum-size k-connected spanning subgraphs via matching , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[34] Anupam Gupta,et al. Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA 2008.
[35] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.