Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
暂无分享,去创建一个
Mohit Singh | R. Ravi | Mohit Singh | R. Ravi
[1] Abraham P. Punnen,et al. The traveling salesman problem and its variations , 2007 .
[2] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[3] Ted Fischer,et al. Optimizing the Degree of Minimum Weight Spanning Trees , 1993 .
[4] R. Ravi,et al. Primal-dual meets local search: approximating MST's with nonuniform degree bounds , 2003, STOC '03.
[5] Satish Rao,et al. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2005, APPROX-RANDOM.
[6] Martin Fürer,et al. Approximating the minimum degree spanning tree to within one from the optimal degree , 1992, SODA '92.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[9] Alantha Newman,et al. Traveling salesman path problems , 2008, Math. Program..
[10] Mark N. Ellingham,et al. Toughness, trees, and walks , 2000, J. Graph Theory.