Greedy Facility Location Algorithms Analyzed using Dual Fitting with FactorRevealing LP
Abstract
In this paper, we will formalize the method of dual fitting and the idea of factorrevealing LP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61, with running times of O(mlog m) and O(n^3), respectively, where n is the total number of vertices and m is the number of edges in the underlying complete bipartite graph between cities and facilities. The algorithms are used to improve recent results for several variants of the problem.
 Publication:

arXiv eprints
 Pub Date:
 July 2002
 arXiv:
 arXiv:cs/0207028
 Bibcode:
 2002cs........7028J
 Keywords:

 Computer Science  Data Structures and Algorithms;
 Computer Science  Computer Science and Game Theory;
 F.2.2;
 G.2.1;
 G.2.2
 EPrint:
 28 pages, 2 figures, 4 tables, abstract appeared in STOC 2002 Montreal