Abstract
This abstract concerns the issue of allocating and utilizing centers in a distributed network, in its various forms. The abstract discusses the significant parameters of center allocation, defines the resulting optimization problems, and proposes several approximation algorithms for selecting centers and for distributing the users among them. We concentrate mainly on balanced versions of the problem, i.e., in which it is required that the assignment of clients to centers be as balanced as possible. The main results are constant ratio approximation algorithms for the balanced κ-centers and balanced κ-weighted centers problems, and logarithmic ratio approximation algorithms for the ρ-dominating set and the κ-tolerant set problems.
Preliminary version
Supported in part by an Allon Fellowship, by a Walter and Elise Haas Career Development Award and by a Bantrell Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Bertsekas. A unified framework for primal-dual methods in minimum cost network flow problems. Math. Prog., 32:125–145, 1985.
D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1987.
A. Bouloutas and P.M. Gopal. Some graph partitioning problems and algorithms related to routing in large computer networks. In Proc. 9th IEEE Conf. on Distributed Computing Systems, pages 362–370, Newport Beach, CA, 1989.
J. Bar-Ilan and D. Peleg. How to allocate network centers. Technical Report CS90-20, The Weizmann Institute of Science, 1990.
A.R. Hevner and A. Rao. Distributed data allocation strategies. In Advances in Computers, Vol. 27, pages 121–155. Academic Press, 1988.
D.S. Hochbaum and D. Shmoys. Powers of graphs: A powerful technique for bottleneck problems. In Proc. 16th ACM Symp. on Theory of Computing, pages 324–333. ACM, April 1984.
L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383–390, 1975.
K. Murthy and J. Kam. An approximation algorithm to the file allocation problem in computer networks. In Proc. 2nd ACM Symp. on Principles of Database Systems, pages 258–266. ACM, 1983.
H.L. Morgan and K.D. Levin. Optimal program and data locations in computer networks. Comm. of the ACM, pages 315–322, 1977.
D. Peleg. Distributed data structures: A complexity oriented view. In 4th Int. Workshop on Distributed Algorithms, September 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Ilan, J., Peleg, D. (1991). Approximation algorithms for selecting network centers. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028274
Download citation
DOI: https://doi.org/10.1007/BFb0028274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54343-5
Online ISBN: 978-3-540-47566-8
eBook Packages: Springer Book Archive