A Faster Implementation of the Goemans-Williamson Clustering Algorithm

Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2001) A Faster Implementation of the Goemans-Williamson Clustering Algorithm. In: The twelfth annual ACM-SIAM symposium on Discrete algorithms, January 07 - 09, Washington, D.C., United States, pp. 17-25.

PDF full.pdf Restricted to Registered users only Download (757kB) | Request a copy

Abstract

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) log^2 n)$ time approximation algorithms for all these problems at the expense of a 1 slight additive degradation of $1/n^k$ in the approximation factor, for any constant k.

Item Type:	Conference Paper
Publication:	Symposium on Discrete Algorithms: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Publisher:	Society for Industrial and Applied Mathematics
Additional Information:	Copyright of this article belongs to Society for Industrial and Applied Mathematics.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	18 Jul 2008
Last Modified:	19 Sep 2010 04:47
URI:	http://eprints.iisc.ac.in/id/eprint/15106

Actions (login required)

View Item