Primal-dual meets local search: Approximating MST's with nonuniform degree bounds

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 389-395

  Könemann, Jochen ^a   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; TREES (MATHEMATICS);

BICRITERIA APPROXIMATION;

COMPUTATION THEORY;

EID: 0038107646     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 134-144, 1991.
2. S. Chopra. On the spanning tree polyhedron. Operations Research Letters, 8:25-29, 1989.
3. M. Fürer and B. Raghavachari. An NC approximation algorithm for the minimum degree spanning tree problem. In Proc. of the 28th Annual Allerton Conf. on Communication, Control and Computing, pages 274-281, 1990.
4. M. Fürer and B. Raghavachari. Approximating the minimum-degree Steiner tree to within one of optimal. Journal of Algorithms, 17(3):409-423, November 1994.
5. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '92), pages 307-316, 1992.
6. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput, 24:296-317, 1995.
7. M. X. Goemans and D. P. Williamson. The primal-dual method for approximation algorithms and its applications to network design problems. In D.S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 144-191. PWS publishing, Boston, 1997.
8. J. Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. In Proceedings, ACM Symposium on Theory of Computing, pages 537-546, 2000.
9. J. Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM J. Comput., 31(6):1783-1793, 2002.
10. R. Krishnan and B. Raghavachari. The directed minimum-degree spanning tree problem. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 21, 2001.
11. J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings, American Mathematical Society, 7:48-50, 1956.
12. 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, ACM Symposium on Theory of Computing, pages 438-447, 1993.
13. 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.
14. R. Ravi, B. Raghavachari, and P. Klein. Approximation through local optimality: Designing networks with small degree. In Proceedings, Conference on Foundations of Software Technology and Theoretical Computer Science, volume 652 of LNCS, pages 279-290. Springer, 1992.