A General k-Level Uncapacitated Facility Location Problem
In this paper a general k-level uncapacitated facility location problem(k-GLUFLP) is proposed. It is shown that the 2-level uncapacitated facility location problem with no fixed cost(2-GLUFLNP) is strong NP-complete and a heuristic algorithm with worst case ratio of 3/2 is given for 2-GLUFLNP when the service costs are assumed to be in the metric space. We also present a randomized 3-approximation algorithm for the k-GLUFLP, when k is a fixed integer.
KeywordsApproximation algorithm Facility location Complexity k-level
Unable to display preview. Download preview PDF.
- 5.Jain, K., Mahdian, M., Saberi, A.: A New Greedy Approach for Facility Location Problem. In: Reif, J. (ed.) Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), Association for Computing Machinery, pp. 731–740 (2002)Google Scholar
- 6.Jain, K., Vazirani, V.V.: Primal-dual Approximation Algorithms for Metric Facility Location and k-median Problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 2–13 (1999) Google Scholar
- 8.Shmoys, D.B., Tardos, E., Aardal, K.I.: Approximation Algorithms for Facility Location Problems. In: Tom Leighton, F., Shor, P. (eds.) Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265–274. ACM, New York (1997)Google Scholar