A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
暂无分享,去创建一个
[1] C. Nash-Williams. Decomposition of Finite Graphs Into Forests , 1964 .
[2] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[3] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[4] Christos H. Papadimitriou,et al. On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.
[5] Satish Rao,et al. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2005, APPROX-RANDOM.
[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] Nikhil Bansal,et al. Additive guarantees for degree bounded directed network design , 2008, STOC.
[8] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[9] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[10] Ted Fischer,et al. Optimizing the Degree of Minimum Weight Spanning Trees , 1993 .
[11] Timothy M. Chan. Euclidean Bounded-Degree Spanning Tree Ratios , 2003, SCG '03.
[12] Balaji Raghavachari,et al. Degree-bounded minimum spanning trees , 2004, CCCG.
[13] A. J.. Analysis of Christofides ' heuristic : Some paths are more difficult than cycles , 2002 .
[14] Satish Rao,et al. A Push-Relabel Algorithm for Approximating Degree Bounded MSTs , 2006, ICALP.
[15] Samir Khuller,et al. Low-Degree Spanning Trees of Small Weight , 1996, SIAM J. Comput..
[16] Mohit Singh,et al. Degree bounded matroids and submodular flows , 2008, Comb..
[17] Mohit Singh,et al. Additive approximation for bounded degree survivable network design , 2008, SIAM J. Comput..
[18] Mohit Singh,et al. Survivable network design with degree or order constraints , 2007, STOC '07.
[19] Martin Fürer,et al. Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.
[20] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[21] R. Ravi,et al. Primal-dual meets local search: approximating MST's with nonuniform degree bounds , 2003, STOC '03.
[22] Mohit Singh,et al. Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs , 2006, ICALP.