TY - JOUR

T1 - A faster implementation of the Goemans-Williamson clustering algorithm

AU - Cole, Richard

AU - Hariharan, Ramesh

AU - Lewenstein, Moshe

AU - Porat, Ely

PY - 2001/12/1

Y1 - 2001/12/1

N2 - We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Prize Collecting Travelling Salesman, 2-Edge Connected Subgraph etc. On a graph with n nodes and m edge, our implementation gives &Ogr; (k(n + m) log 2 n) time approximation algorithms for all these problems at the expense of a slight additive degradation of 1/n k in the approximation factor, for any constant k. Copyright © 2009 ACM, Inc.

AB - We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Prize Collecting Travelling Salesman, 2-Edge Connected Subgraph etc. On a graph with n nodes and m edge, our implementation gives &Ogr; (k(n + m) log 2 n) time approximation algorithms for all these problems at the expense of a slight additive degradation of 1/n k in the approximation factor, for any constant k. Copyright © 2009 ACM, Inc.

UR - http://www.scopus.com/inward/record.url?scp=65549163140&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

JO - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

JF - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -