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

Greedy Facility Location Algorithms analyzed using Dual Fitting with Factor-Revealing LP (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mohammad Mahdian , Evangelos Markakis , Amin Saberi , Vijay Vazirani

Venue:	Journal of the ACM
Citations:	83 - 12 self

BibTeX

@ARTICLE{Mahdian01greedyfacility,
    author = {Mohammad Mahdian and Evangelos Markakis and Amin Saberi and Vijay Vazirani},
    title = {Greedy Facility Location Algorithms analyzed using Dual Fitting with Factor-Revealing LP},
    journal = {Journal of the ACM},
    year = {2001},
    volume = {50},
    pages = {127--137}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We present a natural greedy algorithm for the metric uncapacitated facility location problem and use the method of dual fitting to analyze its approximation ratio, which turns out to be 1.861. The running time of our algorithm is O(m log m), where m is the total number of edges in the underlying complete bipartite graph between cities and facilities. We use our algorithm to improve recent results for some variants of the problem, such as the fault tolerant and outlier versions. In addition, we introduce a new variant which can be seen as a special case of the concave cost version of this problem.

Citations

863	Integer and combinatorial optimization - Wolsey, Nemhauser - 1999
650	Approximation Algorithms - Vazirani - 2003
594	How to model an internetwork - Zegura, Calvert, et al.
277	Approximation algorithms for metric facility location and k-median problems using the primaldual schema and lagrangian relaxation - Jain, Vazirani - 2001
243	On the placement of web server replicas - Qiu, Padmanabham, et al. - 2001
227	Approximation algorithms for facility location problems - Shmoys, Tardos, et al. - 1997
217	On the ratio of optimal integral and fractional covers - Lovasz - 1975
187	Improved combinatorial algorithms for facility location problems - Charikar, Guha
179	Local search heuristics for k-median and facility location problems - Arya, Garg, et al.
168	A constant-factor approximation algorithm for the k-median problem - Charikar, Guha, et al.
162	Greedy strikes back: Improved facility location algorithms - Guha, Khuller - 1999
135	A greedy heuristic for the set covering problem - CHVATAL - 1979
118	Analysis of a local search heuristic for facility location problems - Korupolu, Plaxton, et al.
104	Improved approximation algorithms for uncapacitated facility location - Chudak - 1999
100	On the Placement of Internet Instrumentation - Jamin, Jin, et al. - 2000
100	Improved approximation algorithms for metric facility location problems - Mahdian, Ye, et al.
96	Applications of approximation algorithms to cooperative games - Jain, Vazirani
94	A new greedy approach for facility location problems - Jain, Mahdian, et al.
86	The uncapacitated facility location problem - Cornuejols, Nemhauser, et al. - 1990
82	New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities - McEliece, Rodemich, et al. - 1977
81	An improved approximation ratio for the minimum latency problem - Goemans, Kleinberg - 1996
69	The online median problem - Mettu, Plaxton
68	A heuristic program for locating warehouses - Kuehn, Hamburger - 1963
68	Improved approximation algorithms for a capacitated facility location problem - Chudak, Shmoys - 1999
63	On the optimal placement of web proxies in the Internet - Li, Golin, et al. - 1999
62	Heuristics for the fixed cost median problem - Hochbaum - 1982
61	Hierarchical placement and network design problems - Guha, Meyerson, et al. - 2000
54	Algorithms for facility location problems with outliers - Charikar, Khuller, et al. - 2001
44	Cooperative facility location games - Goemans, Skutella - 2004
40	The Access Network Design Problem - Andrews, Zhang - 1998
37	Samrat Bhattacharjee. How to model an internetwork - Zegura, Calvert - 1996
27	Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs - Rajagopalan, Vazirani - 1998
23	On finding integer solutions to linear programs - Balinski - 1966
23	Animproved approximation algorithm for the metric uncapacitated facility location problem - Sviridenko - 2002
19	The facility location problem with general cost functions - Hajiaghayi, Mahdian, et al.
16	A plant and warehouse location problem - KAUFMAN, EEDE, et al. - 1977
16	Quick k-median, k-center, and facility location for sparse graphs - Thorup
15	An approximate algorithm for the fault tolerant metric facility location problem - Jain, Vazirani
13	k-median, k-center, and facility location for sparse graphs - Quick
12	Approximation Algorithms for Facility Location Problems - Guha - 2000
12	A working model for plant numbers and locations - Stollsteimer - 1963
11	Algorithms for facility location with outliers - Charikar, Khuller, et al. - 2001
10	Improved combinatorial algorithms for single sink edge installation problems - Guha, Meyerson, et al. - 2000
9	Improved algorithms for fault tolerant facility location - GUHA, MEYERSON, et al. - 2003
9	An 1.67-approximation algorithm for the metric uncapacitated facility location problem. Unpublished Manuscript - Sviridenko - 2001
7	Heuristics for the cost median problem - Hochbaum - 1982
6	High-density model for server allocation and placement - Cameron, Low, et al. - 2002
6	V.V.: Primal-dual rnc approximation algorithms for (multi)set (multi)-cover and covering integer programs - Rajagopalan, Vazirani - 1993
6	The effect of technical change and output expansion on the optimum number, size and location of pear marketing facilities in a California pear producing region - STOLLSTEIMER - 1961
6	A plant and warehouse location problem. Operations Research Quarterly - Kaufman, Eede, et al. - 1977