Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, we will formalize the method of dual fitting and the idea of factor-revealing 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.
28 pages, 2 figures, 4 tables, abstract appeared in STOC 2002 Montreal

Keywords

Data Structures and Algorithms, Computer Science and Game Theory, F.2.2;G.2.1;G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31184

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0207028
 http://arxiv.org/abs/cs/0207028

Collections

arXiv