A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
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
Budgeted red-blue median and its generalizations
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
Online and incremental algorithms for facility location
ACM SIGACT News
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
An uncapacitated facility location based cluster hierarchy scheme on wireless sensor networks
WSEAS TRANSACTIONS on COMMUNICATIONS
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
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Constant factor approximation algorithm for the knapsack median problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithm for facility location with service installation costs
Operations Research Letters
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Theoretical Computer Science
Content placement via the exponential potential function method
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
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
| Hi-index | 0.00 |
We present improved combinatorial approximation algorithms for the uncapacitated facility location problem. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of $2.414+\epsilon$ in $\tilde{O}(n^2/\epsilon)$ time. This also yields a bicriteria approximation tradeoff of $(1+\gamma,1+2/\gamma)$ for facility cost versus service cost which is better than previously known tradeoffs and close to the best possible. Combining greedy improvement and cost scaling with a recent primal-dual algorithm for facility location due to Jain and Vazirani, we get an approximation ratio of $1.853$ in $\tilde{O}(n^3)$ time. This is very close to the approximation guarantee of the best known algorithm which is linear programming (LP)-based. Further, combined with the best known LP-based algorithm for facility location, we get a very slight improvement in the approximation factor for facility location, achieving $1.728$. We also consider a variant of the capacitated facility location problem and present improved approximation algorithms for this.