Results 1  10
of
19
Primaldual approximation algorithms for metric facility location and kmedian problems
 Journal of the ACM
, 1999
"... ..."
Greedy strikes back: Improved facility location algorithms
 Journal of Algorithms
, 1999
"... A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well as transportation costs for distributing the co ..."
Abstract

Cited by 182 (12 self)
 Add to MetaCart
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well as transportation costs for distributing the commodities. We assume that the transportation costs form a metric. This problem is commonly referred to as the uncapacitated facility location (UFL) problem. Applications to bank account location and clustering, as well as many related pieces of work, are discussed by Cornuejols, Nemhauser and Wolsey [2]. Recently, the first constant factor approximation algorithm for this problem was obtained by Shmoys, Tardos and Aardal [16]. We show that a simple greedy heuristic combined with the algorithm by Shmoys, Tardos and Aardal, can be used to obtain an approximation guarantee of 2.408. We discuss a few variants of the problem, demonstrating better approximation factors for restricted versions of the problem. We also show that the problem is Max SNPhard. However, the inapproximability constants derived from the Max SNP hardness are very close to one. By relating this problem to Set Cover, we prove a lower bound of 1.463 on the best possible approximation ratio assuming NP / ∈ DT IME[n O(log log n)]. 1
A new greedy approach for facility location problems
"... We present a simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 whereas the best previously known was 1.73. Furthermore, we will show that our algorithm has a property which allows us to apply the technique of Lagra ..."
Abstract

Cited by 116 (9 self)
 Add to MetaCart
We present a simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 whereas the best previously known was 1.73. Furthermore, we will show that our algorithm has a property which allows us to apply the technique of Lagrangian relaxation. Using this property, we can nd better approximation algorithms for many variants of the facility location problem, such as the capacitated facility location problem with soft capacities and a common generalization of the kmedian and facility location problem. We will also prove a lower bound on the approximability of the kmedian problem.
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 100 (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.
Hedging uncertainty: Approximation algorithms for stochastic optimization problems
 In Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization
, 2004
"... We initiate the design of approximation algorithms for stochastic combinatorial optimization problems; we formulate the problems in the framework of twostage stochastic optimization, and provide nearly tight approximation algorithms. Our problems range from the simple (shortest path, vertex cover, ..."
Abstract

Cited by 69 (10 self)
 Add to MetaCart
We initiate the design of approximation algorithms for stochastic combinatorial optimization problems; we formulate the problems in the framework of twostage stochastic optimization, and provide nearly tight approximation algorithms. Our problems range from the simple (shortest path, vertex cover, bin packing) to complex (facility location, set cover), and contain representatives with different approximation ratios. The approximation ratio of the stochastic variant of a typical problem is of the same order of magnitude as its deterministic counterpart. Furthermore, common techniques for designing approximation algorithms such as LP rounding, the primaldual method, and the greedy algorithm, can be carefully adapted to obtain these results. 1
Algorithms for Facility Location Problems with Outliers (Extended Abstract)
 In Proceedings of the 12th Annual ACMSIAM Symposium on Discrete Algorithms
, 2000
"... ) Moses Charikar Samir Khuller y David M. Mount z Giri Narasimhan x Abstract Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outlier ..."
Abstract

Cited by 68 (8 self)
 Add to MetaCart
) Moses Charikar Samir Khuller y David M. Mount z Giri Narasimhan x Abstract Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of various facility location problems (Kcenter, Kmedian, uncapacitated facility location etc) to the case when only a specified fraction of the customers are to be served. What makes the problems harder is that we have to also select the subset that should get service. We provide generalizations of various approximation algorithms to deal with this added constraint. 1 Introduction The facility location problem and the related clustering problems, kmedian and kcenter, are widely studied in operations research and computer science [3, 7, 22, 24, 32]. Typically in...
Facility location: distributed approximation
 In Proceedings of the twentyfourth annual ACM symposium on Principles of distributed computing
, 2005
"... In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a tradeoff between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a tradeoff between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves an O ( √ k(mρ) 1/ √ k log (m + n)) approximation in O(k) communication rounds where message size is bounded to O(log n) bits. The number of facilities and clients are m and n, respectively, and ρ is a coefficient that depends on the cost values of the instance. Our technique is based on a distributed primaldual approach for approximating a linear program, that does not form a covering or packing program.
Universal Facility Location
 in Proc. of ESA ’03
, 2003
"... In the Universal Facility Location problem we are given a set of demand points and a set of facilities. ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
In the Universal Facility Location problem we are given a set of demand points and a set of facilities.
Lagrangian relaxation for the kmedian problem: new insights and continuity properties
 In Proceedings of the 11th Annual European Symposium on Algorithms
, 2003
"... kmedian problem, butour approach does not yield a polynomial time algorithm with this guarantee. We also give a new simple proof of the performance guarantee of the MettuPlaxtonalgorithm using LP duality, which suggests a minor modification of the algorithm that makes it Lagrangianmultiplier pres ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
kmedian problem, butour approach does not yield a polynomial time algorithm with this guarantee. We also give a new simple proof of the performance guarantee of the MettuPlaxtonalgorithm using LP duality, which suggests a minor modification of the algorithm that makes it Lagrangianmultiplier preserving.