Primal-dual meets local search: Approximating MSTs with nonuniform degree bounds

SIAM Journal on Computing

Volumn 34, Issue 3, 2005, Pages 763-773

  Konemann J ^a   Ravi, R ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Bicriteria approximation; Degree bounded spanning trees; Lagrangian relaxation; Network algorithms; Spanning trees

Indexed keywords

APPROXIMATION ALGORITHMS; BICRITERIA APPROXIMATION; DEGREE-BOUNDED SPANNING TREES; LAGRANGIAN RELAXATION; NETWORK ALGORITHMS; SPANNING TREES;

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COSTS; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; SET THEORY; TREES (MATHEMATICS);

APPROXIMATION THEORY;

EID: 20544445756     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702418048     Document Type: Article

References (13)

1. A. AGRAWAL, P. KLEIN, AND R. RAVI, When trees collide: An approximation algorithm for the generalized Steiner problem in networks, SIAM J. Comput., 24 (1995), pp. 440-456.
2. S. CHOPRA, On the spanning tree polyhedron, Oper. Res. Lett., 8 (1989), pp. 25-29.
3. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, MIT Press, Cambridge, MA, 2001.
4. M. FÜRER AND B. RAGHAVACHARI, An NC approximation algorithm for the minimum degree spanning tree problem, in Proceedings of the 28th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana-Champaign, IL, 1990, pp. 274-281.
5. M. FÜRER AND B. RAGHAVACHARI, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17 (1994), pp. 409-423.
6. M. X. GOEMANS AND D. P. WILLIAMSON, A general approximation technique for constrained forest problems, SIAM J. Comput., 24 (1995), pp. 296-317.
7. M. X. GOEMANS AND D. P. WILLIAMSON, The primal-dual method for approximation algorithms and its application to network design problems, in Approximation Algorithms for NP-hard Problems, Dorit S. Hochbaum, ed., PWS, Boston, 1997, pp. 144-191.
8. J. KÖNEMANN AND R. RAVI, A matter of degree: Improved approximation algorithms for degreebounded minimum spanning trees, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 537-546.
9. J. KÖNEMANN AND R. RAVI, A matter of degree: Improved approximation algorithms for degreebounded minimum spanning trees, SIAM J. Comput., 31 (2002), pp. 1783-1793.
10. J. KRUSKAL, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7 (1956), pp. 48-50.
11. R. RAVI, M. V. MARATHE, S. S. RAVI, D. J. ROSENKRANTZ, AND H. B. HUNT, Many birds with one stone: Multi-objective approximation algorithms, in Proceedings of the 25th ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 438-447.
12. R. RAVI, M. V. MARATHE, S. S. RAVI, D. J. ROSENKRANTZ, AND H. B. HUNT, Approximation algorithms for degree-constrained minimum-cost network-design problems, Algorithmica, 31 (2001), pp. 58-78.
13. R. RAVI, B. RAGHAVACHARI, AND P. KLEIN, Approximation through local optimality: Designing networks with small degree, in Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 652, Springer, Berlin, 1992, pp. 279-290.