Analysis of a Local Search Heuristic for
โ
Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 258 KB
In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati