An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem (2002)

Cached

Download Links

[www.cs.umd.edu]

Other Repositories/Bibliography

DBLP

by Maxim Sviridenko

Citations:

23 - 1 self

BibTeX

@MISC{Sviridenko02animproved,
    author = {Maxim Sviridenko},
    title = {An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem},
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We design new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a rounding technique developed in [5-7].

Citations

277	Approximation algorithms for metric facility location and k-median problems using the primaldual schema and lagrangian relaxation - Jain, Vazirani - 2001
227	Approximation algorithms for facility location problems - Shmoys, Tardos, et al. - 1997
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.
162	Greedy strikes back: Improved facility location algorithms - Guha, Khuller - 1999
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
103	Approximation schemes for euclidean k-medians and related problems - Arora, Raghavan, et al. - 1998
94	A new greedy approach for facility location problems - Jain, Mahdian, et al.
83	Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms - Cornuejols, Fisher, et al. - 1977
69	The online median problem - Mettu, Plaxton
68	Improved approximation algorithms for a capacitated facility location problem - Chudak, Shmoys - 1999
64	Approximation algorithms for geometric median problems - Lin, Vitter - 1992
33	Approximation algorithms for Maximum Coverage and Max Cut with Given - Ageev, Sviridenko - 1999
30	A nearly linear-time approximation scheme for the Euclidean k-media problem - Kolliopoulos, Rao
26	A 3approximation algorithm for the k-level uncapacitated facility location problem - Aardal, Chudak, et al. - 1999
24	A threshold of ln n for approximating Set - Feige
21	Eds.), Discrete Location Theory - Mirchandani, Francis - 1990
20	A 1.52 approximation algorithm for the uncapacitated facility location problem - Mahdian, Ye, et al.
17	Reprint of the 1952 edition - Hardy, Littlewood, et al. - 1988
15	An approximation algorithm for hypergraph Max-Cut with given sizes of parts - Ageev, Sviridenko - 2000
13	An approximation algorithm for the uncapacitated facility location problem - Ageev, Sviridenko - 1997
11	Algorithms for facility location with outliers - Charikar, Khuller, et al. - 2001
10	Web caching using access statistics - Meyerson, Munagala, et al. - 2001
9	Improved algorithms for fault tolerant facility location - GUHA, MEYERSON, et al. - 2003
7	Heuristics for the cost median problem - Hochbaum - 1982
6	A 0.5-approximation algorithm for MAX DICUT with given sizes of parts - Ageev, Hassin, et al.
4	Polynomially solvable special cases of the simple plant location problem - Ageev, Beresnev - 1990
2	facility location, and the Cherno-Wald bound - K-medians - 2000
1	An approximation scheme for the uncapacitated facility location problem on planar graphs, manuscript - Ageev
1	A greedy facility location algorithm ananlyzed using dual - Mahdian, Markakis, et al.