Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
An 0.828–approximation algorithm for the uncapacitated facility location problem
Discrete Applied Mathematics
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximation algorithms for the multi-level facility location problem
Approximation algorithms for the multi-level facility location problem
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
Improved combinatorial approximation algorithms for the k-level facility location problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters
A note on the maximization version of the multi-level facility location problem
Operations Research Letters
Operations Research Letters
Approximating k-hop minimum spanning trees in Euclidean metrics
Information Processing Letters
Journal of Discrete Algorithms
A hybrid method for solving large-scale supply chain problems
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
Non-metric multicommodity and multilevel facility location
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
An improved approximation algorithm for uncapacitated facility location problem with penalties
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
The k-level facility location game
Operations Research Letters
Approximating k-hop minimum-spanning trees
Operations Research Letters
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
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.