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

Algorithmica (New York)

Volumn 55, Issue 1, 2009, Pages 157-189

  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

Approximation algorithms; Combinatorial optimization; Matching; Minimum spanning trees

Indexed keywords

APPROXIMATION FACTOR; AUGMENTING PATH; CORNELL UNIVERSITY; DEGREE BOUNDS; DEGREE CONSTRAINTS; EFFICIENT ALGORITHM; IN-DEGREE; LAGRANGEAN RELAXATION; LOCAL SEARCH TECHNIQUES; LOCAL-SEARCH ALGORITHMS; LOWER BOUNDS; MATCHING; MAXIMUM DEGREE; MINIMUM COST SPANNING TREE; MINIMUM DEGREE; MINIMUM SPANNING TREES; OPTIMAL COSTS; PATH PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; PRIMAL-DUAL; PRIMARY CONTRIBUTION; QUASI-POLY-NOMIAL; SOLUTION SPACE; SPANNING TREE; TRAVELLING SALESMAN; UNWEIGHTED GRAPHS; UPPER BOUND; WEIGHTED MATCHING ALGORITHMS;

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; CONTROL THEORY; COSTS; GRAPH THEORY; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 67249123855     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9115-5     Document Type: Article

References (23)

1. Chan, T.M.: Euclidean bounded-degree spanning tree ratios. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pp. 11-19. ACM Press, New York (2003)
2. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would Edmonds do? Augmenting paths and witnesses for degree-bounded msts. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX-RANDOM. Lecture Notes in Computer Science, vol. 3624, pp. 26-39. Springer, New York (2005)
3. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A push-relabel algorithm for approximating degree bounded MSTs. In: ICALP (1). Lecture Notes in Computer Science, vol. 4051, pp. 191-201. Springer, New York (2006) (Pubitemid 44113300)
4. J. Edmonds 1965 Maximum matching and a polyhedron with 0-1 vertices J. Res. Nat. Bur. Stand. 69B 125 130
5. J. Edmonds 1965 Paths, trees, and flowers Can. J. Math. 17 449 467
6. M. Ellingham X. Zha 2000 Toughness, trees and walks J. Graph Theory 33 3 125 137
7. S. Even R.E. Tarjan 1975 Network flow and testing graph connectivity SIAM J. Comput. 4 4 507 518
8. Fischer, T.: Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept. of Computer Science, Cornell University, Ithaca, NY (1993)
9. M. Fürer B. Raghavachari 1994 Approximating the minimum-degree Steiner tree to within one of optimal J. Algorithms 17 3 409 423
10. B. Gavish 1982 Topological design of centralized computer networks-formulations and algorithms Networks 12 355 377
11. Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS, pp. 273-282. IEEE Computer Society, New York (2006)
12. J.A. Hoogeveen 1991 Analysis of Christofides' heuristic: some paths are more difficult than cycles Oper. Res. Lett. 10 291 295
13. 5/2 algorithm for maximum matching in bipartite graphs SIAM J. Comput. 2 225 231
14. Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. In: Proc. 16th Canadian Conf. on Computational Geometry (CCCG), 2004
15. S. Khuller B. Raghavachari N. Young 1996 Low-degree spanning trees of small weight SIAM J. Comput. 25 2 355 368 (Pubitemid 126577276)
16. Könemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In: Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21-23, 2000, pp. 537-546. ACM Press, New York (2000)
17. Könemann, J., Ravi, R.: Primal-dual meets local search: approximating MST's with nonuniform degree bounds. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, 2003, pp. 389-395. ACM Press, New York (2003)
18. Krishnan, R., Raghavachari, B.: The directed minimum degree spanning tree problem. In: FSTTCS, pp. 232-243 (2001) (Pubitemid 33371166)
19. C.H. Papadimitriou U. Vazirani 1984 On two geometric problems related to the traveling salesman problem J. Algorithms 5 231 246
20. Ravi, R., Singh, M.: Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs. In: ICALP (1). Lecture Notes in Computer Science, vol. 4051, pp. 169-180. Springer, New York (2006) (Pubitemid 44113298)
21. Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B. III: Many birds with one stone: multi-objective approximation algorithms. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 438-447. ACM Press, New York (1993) (Pubitemid 23668752)
22. Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B. III: Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31 (2001)
23. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC '07: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 661-670. ACM Press, New York (2007) (Pubitemid 47630785)