Approximation algorithms for selecting network centers

  • Judit Bar-Ilan
  • David Peleg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)


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.


Approximation Algorithm Span Tree Approximation Ratio Constant Approxi Balance Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ber85]
    D. Bertsekas. A unified framework for primal-dual methods in minimum cost network flow problems. Math. Prog., 32:125–145, 1985.Google Scholar
  2. [BG87]
    D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1987.Google Scholar
  3. [BG89]
    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.Google Scholar
  4. [BP90]
    J. Bar-Ilan and D. Peleg. How to allocate network centers. Technical Report CS90-20, The Weizmann Institute of Science, 1990.Google Scholar
  5. [HR88]
    A.R. Hevner and A. Rao. Distributed data allocation strategies. In Advances in Computers, Vol. 27, pages 121–155. Academic Press, 1988.Google Scholar
  6. [HS84]
    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.Google Scholar
  7. [Lov75]
    L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383–390, 1975.Google Scholar
  8. [MK83]
    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.Google Scholar
  9. [ML77]
    H.L. Morgan and K.D. Levin. Optimal program and data locations in computer networks. Comm. of the ACM, pages 315–322, 1977.Google Scholar
  10. [Pel90]
    D. Peleg. Distributed data structures: A complexity oriented view. In 4th Int. Workshop on Distributed Algorithms, September 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Judit Bar-Ilan
    • 1
  • David Peleg
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of HaifaHaifaIsrael
  2. 2.Department of Applied Mathematics and Computer ScienceThe Weizmann InstituteRehovotIsrael

Personalised recommendations