Approximation algorithms for selecting network centers

Judit Bar-Ilan; David Peleg

doi:10.1007/bfb0028274

Approximation algorithms for selecting network centers

Judit Bar-Ilan, David Peleg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

22 Scopus citations

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.

Original language	English
Title of host publication	Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings
Editors	Frank Dehne, Jorg-Rudiger Sack, Nicola Santoro
Publisher	Springer Verlag
Pages	343-354
Number of pages	12
ISBN (Print)	9783540475668
DOIs	https://doi.org/10.1007/bfb0028274
State	Published - 1991
Externally published	Yes
Event	2nd Workshop on Algorithms and Data Structures, WADS 1991 - Ottawa, Canada Duration: 14 Aug 1991 → 16 Aug 1991

Publication series

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

Conference

Conference	2nd Workshop on Algorithms and Data Structures, WADS 1991
Country/Territory	Canada
City	Ottawa
Period	14/08/91 → 16/08/91

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Access to Document

10.1007/bfb0028274

Cite this

Bar-Ilan, J., & Peleg, D. (1991). Approximation algorithms for selecting network centers. In F. Dehne, J.-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings (pp. 343-354). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 519 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0028274

Bar-Ilan, Judit ; Peleg, David. / Approximation algorithms for selecting network centers. Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Nicola Santoro. Springer Verlag, 1991. pp. 343-354 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1aa8624719734b2b84cb19c5b60f1a82,

title = "Approximation algorithms for selecting network centers",

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.",

author = "Judit Bar-Ilan and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 2nd Workshop on Algorithms and Data Structures, WADS 1991 ; Conference date: 14-08-1991 Through 16-08-1991",

year = "1991",

doi = "10.1007/bfb0028274",

language = "אנגלית",

isbn = "9783540475668",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "343--354",

editor = "Frank Dehne and Jorg-Rudiger Sack and Nicola Santoro",

booktitle = "Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings",

address = "גרמניה",

}

Bar-Ilan, J & Peleg, D 1991, Approximation algorithms for selecting network centers. in F Dehne, J-R Sack & N Santoro (eds), Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS, Springer Verlag, pp. 343-354, 2nd Workshop on Algorithms and Data Structures, WADS 1991, Ottawa, Canada, 14/08/91. https://doi.org/10.1007/bfb0028274

Approximation algorithms for selecting network centers. / Bar-Ilan, Judit; Peleg, David.
Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Nicola Santoro. Springer Verlag, 1991. p. 343-354 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 519 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximation algorithms for selecting network centers

AU - Bar-Ilan, Judit

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84983692906&partnerID=8YFLogxK

U2 - 10.1007/bfb0028274

DO - 10.1007/bfb0028274

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84983692906

SN - 9783540475668

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 343

EP - 354

BT - Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Santoro, Nicola

PB - Springer Verlag

T2 - 2nd Workshop on Algorithms and Data Structures, WADS 1991

Y2 - 14 August 1991 through 16 August 1991

ER -

Bar-Ilan J, Peleg D. Approximation algorithms for selecting network centers. In Dehne F, Sack JR, Santoro N, editors, Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Springer Verlag. 1991. p. 343-354. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0028274

Approximation algorithms for selecting network centers

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this