Universal Facility Location
In the Universal Facility Location problem we are given a set of demand points and a set of facilities. The goal is to assign the demands to facilities in such a way that the sum of service and facility costs is minimized. The service cost is proportional to the distance each unit of demand has to travel to its assigned facility, whereas the facility cost of each facility i depends on the amount of demand assigned to that facility and is given by a cost function f i (·). We present a (7.88 + ε)-approximation algorithm for the Universal Facility Location problem based on local search, under the assumption that the cost functions f i are nondecreasing. The algorithm chooses local improvement steps by solving a knapsack-like subproblem using dynamic programming. This is the first constant-factor approximation algorithm for this problem. Our algorithm also slightly improves the best known approximation ratio for the capacitated facility location problem with non-uniform hard capacities.
KeywordsFacility Location Local Search Algorithm Facility Location Problem Demand Point Local Search Heuristic
Unable to display preview. Download preview PDF.
- 1.Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. In: Proceedings of 33rd ACM Symposium on Theory of Computing (2001)Google Scholar
- 2.Balinski, M.L.: On finding integer solutions to linear programs. In: Proc. IBM Scientific Computing Symposium on Combinatorial Problems, pp. 225–248 (1966)Google Scholar
- 3.Bauer, P., Enders, R.: A capacitated facility location problem with integer decision variables. In: International Symposium on Math. Programming (1997)Google Scholar
- 4.Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of FOCS 1999, pp. 378–388 (1999)Google Scholar
- 9.Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science (2000)Google Scholar
- 11.Karger, D., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (2000)Google Scholar
- 13.Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms, January 1998, pp. 1–10 (1998)Google Scholar
- 16.Mahdian, M., Ye, Y., Zhang, J.: A 2-approximation algorithm for the soft-capacitated facility location problem. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 129–140. Springer, Heidelberg (2003)Google Scholar
- 18.Pál, M., Tardos, E., Wexler, T.: Facility location with hard capacities. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (2001)Google Scholar