Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
Importance sampling via load-balanced facility location
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Placement of replicated tasks for distributed stream processing systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
From stars to comets: Improved local search for universal facility location
Operations Research Letters
| Hi-index | 0.00 |
The Universal Facility Location problem (UniFL) is a generalized formulation which contains several variants of facility location including capacitated facility location (1-CFL) as its special cases. We present a 6 + ε approximation for the UniFL problem, thus improving the 8 + ∈ approximation given by Mahdian and Pal. Our result bridges the existing gap between the UniFL problem and the 1-CFL problem.