What would edmonds do? Augmenting paths and witnesses for degree-bounded MSTs

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 26-39

  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; COSTS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SEARCH ENGINES;

BUCRITERIA APPROXIMATION; COST SPANNING; LOCAL SEARCH TECHNIQUES; POLYNOMIAL-TIME ALGORITHM;

TREES (MATHEMATICS);

EID: 26944492182     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_3     Document Type: Conference Paper

References (15)

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. J. Edmonds. Maximum matching and a polyhedron with 0-1 vertices. Journal of Research National Bureau of Standards, 69B:125-130, 1965.
3. J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
4. S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, 4(4):507-518, Dec. 1975.
5. T. Fischer. Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept of Computer Science, Cornell University, Ithaca, NY, 1993.
6. 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.
7. J. Hopcroft and R. Karp. An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2:225-231, 1973.
8. R. Jothi and B. Raghavachari. Degree-bounded minimum spanning trees. In Proc. 16th Canadian Conf. on Computational Geometry (CCCG), 2004.
9. S. Khuller, B. Raghavachari, and N. Young. Low-degree spanning trees of small weight. SIAM J. Comput., 25(2):355-368, 1996.
10. J. Könemann and R. Ravi. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In Proceedings of ACM STOC, 2000.
11. J. Könemann and R. Ravi. Primal-dual meets local search: approximating MST's with nonuniform degree bounds. In ACM, editor, Proceedings ACM STOC, 2003.
12. R. Krishnan and B. Raghavachari. The directed minimum degree spanning tree problem. In FSTTCS, pages 232-243, 2001.
13. C. H. Papadimitriou and U. Vazirani. On two geometric problems related to the traveling salesman problem. J. Algorithms, 5:231-246, 1984.
14. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, III. Many birds with one stone: multi-objective approximation algorithms. In Proceedings of ACM STOC,1993.
15. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, III. Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica, 31, 2001.