Approximating minimum bounded degree spanning trees to within one of optimal

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 661-670

  Singh, Mohit ^a   Lau, Lap Chi ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithm; Bounded degree; Iterative rounding; Spanning trees

Indexed keywords

APPROXIMATION ALGORITHMS; ITERATIVE METHODS; POLYNOMIALS;

BOUNDED DEGREE; ITERATIVE ROUNDING; SPANNING TREES;

TREES (MATHEMATICS);

EID: 35448997003     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250887     Document Type: Conference Paper

References (21)

1. K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar, What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs, In Proceedings of 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 26-39, 2005.
2. K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. Push relabel and an improved approximation algorithm for the bounded-degree mst problem, In Proceedings of 33th International Colloquium on Automata, Languages and Programming, 2006.
3. William H. Cunningham, Testing membership in matroid polyhedra, Journal of Combinatorial Theory, Series B 36(2): 161-188, 1984.
4. J. Cheriyan, S. Vempala and A. Vetta, Network design via iterative rounding of setpair relaxations, Combinatorica 26(3) pp. 255-275, 2006.
5. G. Cornuejols, D. Naddef and J. Fonlupt The Traveling Salesman Problem on a Graph and some related Integer Polyhedra, Mathematical Programming, 33, pp. 1-27, 1985.
6. J. Edmonds, Matroids and the Greedy Algorithm. Mathematical Programming, 1:125-136, 1971.
7. L. Fleischer, K. Jain and D.P. Williamson, Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems., J. Comput. Syst. Sci. 72:5, 2006.
8. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. of Algorithms 17(3):409-423, 1994.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, USA, 1979.
10. M.X. Goemans, Minimum Bounded-Degree Spanning Trees, Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 273-282, 2006.
11. D.S. Hochbaum, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, USA, 1997.
12. K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21, pp.39-60, 2001.
13. J. Könemann and R. Ravi, A matter of degree: Improved approximation algorithms for degree bounded minimum spanning trees, SIAM J. on Computing, 31:1783-1793, 2002.
14. J. Könemann and R. Ravi, Primal-Dual meets local searchapproximating MSTs with nonuniform degree bounds, SIAM J. on Computing, 34(3):763-773, 2005.
15. L.C. Lau, S. Naor, M. Salavatipour and M. Singh, Survivable network design with degree or order constraints, in Proceedings of the 39th ACM Symposium on Theory of Computing, 2007.
16. T. Magnanti, L. Wolsey, Optimal trees, Network, Models, Handbook, in Operations Research and Management Science, M.O. Ball et al ed., Amsterdam, North-Holland, pp: 503-615, 1995.
17. V. Melkonian and E. Tardos, Algorithms for a Network Design Problem with Crossing Supermodular Demands, Networks, 43(4):256-265, 2004.
18. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrants, and, H.B. Hunt, Many birds with one stone: Multi-objective approximation algorithms, in Proceedings of the 25th ACM-Symposium on Theory of Computing, pp 438-447, 1993.
19. R. Ravi and M. Singh, Delegate and Conquer: An LP-based approximation algorithm for Minimum Degree MSTs. In Proceedings of 33rd International Colloquium on Automata, Languages and Programming, 2006.
20. A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency, Springer-Verlag, New York, 2005.
21. V. Vazirani, Approximation Algorithms, Springer, 2001.