A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
WWW '05 Proceedings of the 14th international conference on World Wide Web
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A continuous facility location problem and its application to a clustering problem
Proceedings of the 2008 ACM symposium on Applied computing
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
Capacitated domination problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
Transportation Science
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
An approximation algorithm for the k-level capacitated facility location problem
Journal of Combinatorial Optimization
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
Fast approximation in subspaces by doubling metric decomposition
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
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)
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
INFORMS Journal on Computing
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
Fast bounding procedures for large instances of the Simple Plant Location Problem
Computers and Operations Research
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Journal of Global Optimization
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
A cost-sharing method for an economic lot-sizing game
Operations Research Letters
Approximation algorithm for facility location with service installation costs
Operations Research Letters
A 1.488 approximation algorithm for the uncapacitated facility location problem
Information and Computation
Approximation Algorithms for Capacitated Location Routing
Transportation Science
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
INFORMS Journal on Computing
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
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
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 linear programming relaxation of the problem. Furthermore, we will show, using a result of Thorup, that our algorithms can be implemented in quasi-linear time.