Results 1 
4 of
4
Primaldual approximation algorithms for metric facility location and kmedian problems
 Journal of the ACM
, 1999
"... ..."
Greedy Facility Location Algorithms analyzed using Dual Fitting with FactorRevealing LP
 Journal of the ACM
, 2001
"... 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 c ..."
Abstract

Cited by 101 (13 self)
 Add to MetaCart
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.
Using linear programming in the design and analysis of approximation algorithms: two illustrative problems
 Approximation Algorithms for Combinatorial Optimization, K. Jansen and J. Rolim (Eds
, 1998
"... One of the foremost techniques in the design and analysis of approximation algorithms is to round the optimal solution to a linear programming relaxation in order to compute a nearoptimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the un ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
One of the foremost techniques in the design and analysis of approximation algorithms is to round the optimal solution to a linear programming relaxation in order to compute a nearoptimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the uncapacitated facility location problem and the problem of scheduling precedenceconstrained jobs on one machine so as to minimize a weighted average of their completion times.