Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

In this article, 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 ( m...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of the ACM 2003-11, Vol.50 (6), p.795-824
Hauptverfasser: Jain, Kamal, Mahdian, Mohammad, Markakis, Evangelos, Saberi, Amin, Vazirani, Vijay V
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Facilities planning
Fittings
Graph theory
Greedy algorithms
Location analysis
Mathematical analysis
Operations research
Site selection
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this article, 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 ( m log 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.
ISSN:0004-5411
1557-735X
DOI:10.1145/950620.950621