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
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Approximation algorithms
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Multicommodity facility location
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
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Improved Combinatorial Algorithms for Facility Location Problems
SIAM Journal on Computing
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation for universal facility location
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Submodular cost allocation problem and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
Approximation Algorithms for Integrated Distribution Network Design Problems
INFORMS Journal on Computing
| Hi-index | 0.00 |
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodular costs, called hierarchical facility costs, and give a (4.237 + &epsis;)-approximation algorithm using local search. The hierarchical facility costs model multilevel service installation. Shmoys et al. [2004] gave a constant factor approximation algorithm for a two-level version of the problem. Here we consider a multilevel problem, and give a constant factor approximation algorithm, independent of the number of levels, for the case of identical costs on all facilities.