Sciweavers

Share
SODA
2001
ACM

A faster implementation of the Goemans-Williamson clustering algorithm

9 years 5 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
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 edges, our implementation gives O k(n + m) log2 n time approximation algorithms for all these problems at the expense of a slight additive degradation of 1 nk in the approximation factor, for any constant k.
Richard Cole, Ramesh Hariharan, Moshe Lewenstein,
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where SODA
Authors Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Comments (0)
books