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
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
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
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Computers and Operations Research
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
On the design of the next generation access networks
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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
Computers and Industrial Engineering
Hi-index | 0.00 |
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, selects a sub-optimal candidate at each step. It also relates the minimization 2-LFLP problem, in an interesting way, to the maximization version of the single level facility location problem. Another feature of our algorithm is that it combines the technique of randomized rounding with that of dual fitting.This new approach enables us to approximate the metric 2-LFLP in polynomial time with a ratio of 1.77, a significant improvement on the previously known approximation ratios. Moreover, our approach results in a local improvement procedure for the 2-LFLP, which is useful in improving the approximation guarantees for several other multi-level facility location problems. An additional result of our approach is an O(ln (n))-approximation algorithm for the non-metric 2-LFLP, where n is the number of clients. This is the first non-trivial approximation for a non-metric multi-level facility location problem.