Additive approximation for bounded degree survivable network design
暂无分享,去创建一个
[1] Satish Rao,et al. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2009, Algorithmica.
[2] Mohit Singh,et al. Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs , 2006, ICALP.
[3] Anujan Varma,et al. Degree-constrained multicasting in point-to-point networks , 1995, Proceedings of INFOCOM'95.
[4] Mohit Singh,et al. Degree bounded matroids and submodular flows , 2008, Comb..
[5] R. Ravi,et al. Approximation algorithms for finding low-degree subgraphs , 2004, Networks.
[6] Michel X. Goemans,et al. Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Mohit Singh,et al. Survivable network design with degree or order constraints , 2007, STOC '07.
[8] Nikhil Bansal,et al. Additive guarantees for degree bounded directed network design , 2008, STOC.
[9] Rajeev Motwani,et al. K-connected Spanning Subgraphs of Low Degree , 2006, Electron. Colloquium Comput. Complex..
[10] Universitat-Gesamthochschule Paderborn. BOUNDED DEGREE SPANNING TREES , 1997 .
[11] 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).
[12] Balaji Raghavachari,et al. Algorithms for finding low degree structures , 1996 .
[13] Satish Rao,et al. A Push-Relabel Algorithm for Approximating Degree Bounded MSTs , 2006, ICALP.
[14] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[15] Stefan Voß,et al. Problems with generalized steiner problems , 1992, Algorithmica.
[16] Nisheeth K. Vishnoi,et al. Improved Algorithm for Degree Bounded Survivable Network Design Problem , 2009, SWAT.
[17] R. Ravi,et al. Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees , 2003, FSTTCS.
[18] Martin Fürer,et al. Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.
[19] Kamal Jain. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..
[20] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[21] Panos M. Pardalos,et al. A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..
[22] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[23] R. Ravi,et al. Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds , 2005, SIAM J. Comput..