A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A constant approximation algorithm for the one-warehouse multi-retailer problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Replicated Server Placement with QoS Constraints
IEEE Transactions on Parallel and Distributed Systems
Theoretical Computer Science - Algorithmic applications in management
Proceedings of the 8th ACM conference on Electronic commerce
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Locating network monitors: Complexity, heuristics, and coverage
Computer Communications
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
An algorithm for the facility location problems
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
A primal-dual approximation algorithm for the k-level stochastic facility location problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
Approximation algorithm for the uniform bounded facility problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
A 1.488 approximation algorithm for the uncapacitated facility location problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the $p$-Median Polytope and the Intersection Property: Polyhedra and Algorithms
SIAM Journal on Discrete Mathematics
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the placement of active monitor in IP network
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
An approximation algorithm for a facility location problem with stochastic demands and inventories
Operations Research Letters
Approximation algorithm for facility location with service installation costs
Operations Research Letters
Computer Science Review
Near-optimal solutions to large-scale facility location problems
Discrete Optimization
Improved LP-rounding approximation algorithm for k-level uncapacitated facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A dependent LP-rounding approach for the k-median problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A 1.488 approximation algorithm for the uncapacitated facility location problem
Information and Computation
Approximation Algorithms for Capacitated Location Routing
Transportation Science
Approximating k-median via pseudo-approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximation algorithm for uniform bounded facility location problem
Journal of Combinatorial Optimization
Approximating the reliable resource allocation problem using inverse dual fitting
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Improved approximation algorithms for constrained fault-tolerant resource allocation
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We consider the uncapacitated facility location problem. In this problem, there is a set of locations at which facilities can be built; a fixed cost fi is incurred if a facility is opened at location i. Furthermore, there is a set of demand locations to be serviced by the opened facilities; if the demand location j is assigned to a facility at location i, then there is an associated service cost proportional to the distance between i and j, cij. The objective is to determine which facilities to open and an assignment of demand points to the opened facilities, so as to minimize the total cost. We assume that the distance function c is symmetric and satisfies the triangle inequality. For this problem we obtain a (1+2/e)-approximation algorithm, where $1+2/e \approx 1.736$, which is a significant improvement on the previously known approximation guarantees.The algorithm works by rounding an optimal fractional solution to a linear programming relaxation. Our techniques use properties of optimal solutions to the linear program, randomized rounding, as well as a generalization of the decomposition techniques of Shmoys, Tardos, and Aardal [Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 265--274].