Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 169-180

  Ravi, R ^a   Singh, Mohit ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; GRAPH THEORY; TREES (MATHEMATICS);

LOWER BOUND; SPANNING TREE; SUBGRAPHS;

APPROXIMATION THEORY;

EID: 33746354336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_16     Document Type: Conference Paper

References (13)

1. Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, and Kunal 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, 2005.
2. Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, and Kunal Talwar. Push Relabel and an Improved Approximation Algorithm for the Bounded-degree MST Problem. In To Appear in ICALP, 2006.
3. Mark Ellingham and Xiaoya Zha. Toughness, trees and walks. J. Graph Theory, 33:125-137, 2000.
4. T. Fischer. Optimizing the degree of minimum weight spanning trees. Technical report, Department of Computer Science, Cornell University, 1993.
5. Martin Purer and Balaji Raghavachari. Approximating the minimum degree spanning tree to within one from the optimal degree. In SODA '92: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pages 317-324, Philadelphia, PA, USA, 1992. Society for Industrial and Applied Mathematics.
6. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979.
7. Michel Goemans. Personal Communication.
8. G. Gutin and A P Punnen eds. Traveling salesman problem and its variations. Kluwer Publications, 2002.
9. J. Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. In STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 537-546, New York, NY, USA, 2000. ACM Press.
10. Jochen Könemann and R. Ravi. Primal-dual meets local search: Approximating MST's with nonuniform degree bounds. In STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 389-395, New York, NY, USA, 2003. ACM Press.
11. Fumei Lam and Alantha Newman. Traveling salesman path perfect graphs. Preprint, 2006.
12. George L. Nemhauser and Laurence A. Wolsey. Integer and combinatorial optimization. Wiley-Interscience, New York, NY, USA, 1988.
13. R. Ravi and Mohit Singh. Delegate and Conquer: An LP-based approximation algorithm for Minimum Degree MSTs. Technical report, Tepper School of Business, Carnegie Mellon University, 2006.