Abstract
The bounded k-median problem is to select in an undirected graph G = (V,E) a set S of k vertices such that the maximum distance from a vertex v ∈ V to S is at most a given bound d and the average distance from vertices V to S is minimized. We present randomized algorithms for several versions of this problem. We also study the bounded version of the uncapacitated facility location problem. For this latter problem we present extensions of known deterministic algorithms for the unbounded version, and we prove some inapproximability results.
This work was supported in part by EU ESPRIT LTR No. 20244 (ALCOM-IT).
Supported by DFG Graduiertenkolleg Informatik, Universität des Saarlandes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, P. Raghavan and S. Rao, Approximation schemes for Euclidean k-medians and related problems, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 106–113, 1998.
O. Berman and E.K. Yang, Medi-center location problems, Journal of the Operational Research Society, 42, 313–322, 1991.
M. Charikar, Ch. Chekuri, A. Goel and S. Guha, Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 114–123, 1998.
M. Charikar, S. Guha, É. Tardos, and D.B. Shmoys, A constant-factor approximation algorithm for the k-median problem, to appear in the Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.
S. Chaudhuri, N. Garg and R. Ravi, The p-neighbor k-center problem, Information Processing Letters, 65, 131–134, 1998.
I.C. Choi and S.S. Chaudhry, The p-median problem with maximum distance constraints: a direct approach, Location Science, 1, 235–243, 1993.
F. Chudak, Improved approximation algorithms for uncapacitated facility location, in Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, 180–194, 1998.
G. Cornuejols, G.L. Nemhauser, and L.A. Wolsey, The uncapacitated facility location problem, in Discrete Location Theory (Mirchandani and Francis, editors), Wiley, New York, pp. 119–171, 1990.
Z. Drezner, editor, Facility location. A survey of applications and methods, Springer-Verlag, New York, 1995.
U. Feige, A threshold of ln n for approximating set cover, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 314–318, 1996.
S. Guha and S. Khuller, Greedy strikes back: improved facility location algorithms, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 649–657, 1998.
D.S. Hochbaum, Various notions of approximations: good, better, best, and more, in Approximation Algorithms for NP-hard Problems (D. Hochbaum, editor), PWS Company, Boston, 1997.
D.S. Hochbaum and D.B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM, 33, 533–550, 1986.
A.K. Jain and R.C. Dubes, Algorithms for clustering data, Prentice Hall, 1981.
S. Khuller, R. Pless and Y. J. Sussmann, Fault tolerant k-center problems, to appear in Theoretical Computer Science, 1999.
J.H. Lin and J.S. Vitter, ∈-approximations with minimum packing constraint violation, Proceedings 24th ACM Symposium on Theory of Computing, 771–782.
J.H. Lin and J.S. Vitter, Approximation algorithms for geometric median problems, Information Processing Letters, 44, 245–249, 1992.
D.B. Shmoys, É. Tardos, and K. Aardal, Approximation algorithms for facility location problems, Proceedings of the 29th ACM Symposium on Theory of Computing, 265–274, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krysta, P., Solis-Oba, R. (1999). Approximation Algorithms for Bounded Facility Location. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_24
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive