Approximation algorithms for minimum tree partition

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 117-137

  Guttmann Beck, Nili ^a   Hassin, Refael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Graph partitioning; Minimum spanning tree

Indexed keywords

EID: 0042722346     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00052-3     Document Type: Article

References (10)

1. B. Chandra, M. Halldórsson, Facility dispersion and remote subgraphs, Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science, vol. 1097, Springer, Berlin, 1996, pp. 53-65.
2. H.N. Gabow, M.X. Goemans, D.P. Williamson, An efficient approximation algorithm for the survivable network design problem, Mathematical Programming 82 (1998) 13-40.
3. D. Gale, Optimal assignments in an ordered set: An application of matroid theory, J. Comb. Theory 4 (1968) 176-180.
4. M.X. Goemans, D.P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Comput. 24 (1995) 296-317.
5. M.X. Goemans, D.P. Williamson, Approximating minimum-cost graph problems with spanning tree edges, Oper. Res. Lett. 16 (1994) 183-189.
6. N. Guttmann-Beck, R. Hassin, Approximation algorithms for min-max tree partition, J. Algorithms 24 (1997) 266-286.
7. C. Imielińska, B. Kalantari, L. Khachiyan, A greedy heuristic for a minimum-weight forest problem Oper. Res. Lett. 14, (1993) 65-71.
8. O. Kariv, S.L Hakimi, An algorithmic approach to network location problems, Part II: p-medians, SIAM J. Appl. Math. 37 (1979) 539-560.
9. E.L Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
10. D.P. Williamson, On the design of approximation algorithms for a class of graph problems, Ph.D. Thesis, MIT, Cambridge, MA, 1990.