In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the integrality gap of the standard LP relaxation of the problem. Furthermore, we will show, using a result of Thorup, that our algorithms can be implemented in quasi-linear time
This paper surveys approximation algorithms for various facility location problems, mostly with det...
AbstractIn this article we focus on approximation algorithms for facility location problems with sub...
In this paper, we study approximation algorithms for several NP-hard facility location problems. We ...
There has been a great deal of recent work on approximation algorithms for facility location problem...
We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility...
The main purpose of this work is to present the basics and history of the metric uncapacitated facil...
We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1¿...
We present approximation algorithms for the metric uncapacitated facility location problem and the m...
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL) problem...
Metric facility location is a well-studied problem for which linear programming methods have been us...
We consider a generalization of the Squared Euclidean Facility Location Problem, when the distance f...
AbstractThe k-facility location problem is a common generalization of the facility location and the ...
We study the capacitated k-facility location problem, in which we are given a set of clients with de...
In this article we focus on approximation algorithms for facility location problems with subadditive...
In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP. T...
This paper surveys approximation algorithms for various facility location problems, mostly with det...
AbstractIn this article we focus on approximation algorithms for facility location problems with sub...
In this paper, we study approximation algorithms for several NP-hard facility location problems. We ...
There has been a great deal of recent work on approximation algorithms for facility location problem...
We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility...
The main purpose of this work is to present the basics and history of the metric uncapacitated facil...
We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1¿...
We present approximation algorithms for the metric uncapacitated facility location problem and the m...
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL) problem...
Metric facility location is a well-studied problem for which linear programming methods have been us...
We consider a generalization of the Squared Euclidean Facility Location Problem, when the distance f...
AbstractThe k-facility location problem is a common generalization of the facility location and the ...
We study the capacitated k-facility location problem, in which we are given a set of clients with de...
In this article we focus on approximation algorithms for facility location problems with subadditive...
In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP. T...
This paper surveys approximation algorithms for various facility location problems, mostly with det...
AbstractIn this article we focus on approximation algorithms for facility location problems with sub...
In this paper, we study approximation algorithms for several NP-hard facility location problems. We ...