Approximation algorithms for selecting network centers

Judit Bar-Ilan, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Nicola Santoro
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540475668
StatePublished - 1991
Externally publishedYes
Event2nd Workshop on Algorithms and Data Structures, WADS 1991 - Ottawa, Canada
Duration: 14 Aug 199116 Aug 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume519 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd Workshop on Algorithms and Data Structures, WADS 1991

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.


Dive into the research topics of 'Approximation algorithms for selecting network centers'. Together they form a unique fingerprint.

Cite this