A push-relabel algorithm for approximating degree bounded MSTs

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

Volumn 4051 LNCS, Issue , 2006, Pages 191-201

  Chaudhuri, Kamalika ^a   Rao, Satish ^a   Riesenfeld, Samantha ^a   Talwar, Kunal ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION ALGORITHM; COMBINATORIAL PROBLEMS; MINIMUM SPANNING TREE;

TREES (MATHEMATICS);

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

References (16)

1. T. M. Chan. Euclidean bounded-degree spanning tree ratios. In Proceedings of the nineteenth annual symposium on Computational geometry, pages 11-19. ACM Press, 2003.
2. K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. What would edmonds do? augmenting paths and witnesses for bounded degree msts. In Proceedings of APPROX/RANDOM, 2005.
3. J. Edmonds. Maximum matching and a polyhedron with 0-1 vertices. Journal of Research National Bureau of Standards, 69B:125-130, 1965.
4. T. Fischer. Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept of Computer Science, Cornell University, Ithaca, NY, 1993.
5. M. Fürer and B. Raghavachari. Approximating the minimum-degree Steiner tree to within one of optimal. Journal of Algorithms, 17(3):409-423, Nov. 1994.
6. M. Goemans. Personal communication, 2006.
7. A. V. Golberg. A new max-flow algorithm. Technical Report MIT/LCS/TM-291, Massachussets Institute of Technology, 1985. Technical Report.
8. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. In Proceedings of the eighteenth annual ACM symposium on Theory of computing, pages 136-146. ACM Press, 1986.
9. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4)-.921-940, 1988.
10. J. A. Hoogeveen. Analysis of christofides' heuristic: Some paths are more difficult than cycles. Operation Research Letters, 10:291-295, 1991.
11. R. Jothi and B. Raghavachari. Degree-bounded minimum spanning trees. In Proc. 16th Canadian Conf. on Computational Geometry (CCCG), 2004.
12. S. Khuller, B. Raghavachari, and N. Young. Low-degree spanning trees of small weight. SIAM J. Comput., 25(2):355-368, 1996.
13. J. Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM Journal on Computing, 31(6):1783-1793, Dec. 2002.
14. J. Könemann and R. Ravi. Primal-dual meets local search: approximating MST's with nonuniform degree bounds. In ACM, editor, Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, 2003, pages 389-395, New York, NY, USA, 2003. ACM Press.
15. C. H. Papadimitriou and U. Vazirani. On two geometric problems related to the traveling salesman problem. J. Algorithms, 5:231-246, 1984.
16. R. Ravi and M. Singh. Delegate and conquer: An LP-based approximation algorithm for minimum degree msts. In Proceedings of ICALP, 2006.