How to allocate network centers

Judit Bari-Lan, Guy Kortsarz, David Peleg

Research output: Contribution to journalArticlepeer-review


This paper deals with the issue of allocating and utilizing centers in a distributed network, in its various forms. The paper 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 k-tolerant set problems.

Original languageEnglish
Pages (from-to)385-415
Number of pages31
JournalJournal of Algorithms
Issue number3
StatePublished - Nov 1993
Externally publishedYes


Dive into the research topics of 'How to allocate network centers'. Together they form a unique fingerprint.

Cite this