A faster implementation of the Goemans-Williamson clustering algorithm

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 17-25

  Cole, Richard ^a   Hariharan, Ramesh ^b   Lewenstein, Moshe ^a,c   Porat, Ely ^c  

^a NEW YORK UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 65549163140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Ajit Agrawal, Philip Klein, R. Ravi, When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks, SIAM Journal on Computing, v.24 n.3, p.440-456, June 1995 [doi〉10.1137/S0097539792236237]
2. Michel X. Goemans, David P. Williamson, A General Approximation Technique for Constrained Forest Problems, SIAM Journal on Computing, v.24 n.2, p.296-317, April 1995 [doi〉10.1137/S0097539793242618]
3. H. Gabow, M. Goemans, D. Williamson. An efficient approximation algorithm for the survivable network design problem, Proceedings of IPCO, 1993, pp. 57-74. To appear in Math. Programming.
4. David S. Johnson , Maria Minkoff , Steven Phillips, The prize collecting Steiner tree problem: theory and practice, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.760-769, January 09-11, 2000, San Francisco, California, United States
5. Philip N. Klein, A data structure for bicategories, with application to speeding up an approximation algorithm, Information Processing Letters, v.52 n.6, p.303-307, Dec. 23, 1994 [doi>10.1016/0020-0190(94)00156-1]
6. R. Ravi and P. Klein. When cycles collapse: A general approximation technique for constrained two connectivity problems, Proceedings of IPCO, 1993, pp. 39-55.
7. D. Williamson, M. Goemans, M. Mihail, V. Vazirani. A primal-dual approximation algorithm for generalized steiner network problems, Combinatorica, 15, 1995, pp. 435-454.