×

zbMATH — the first resource for mathematics

How to allocate network centers. (English) Zbl 0784.68012
Summary: The 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 \(\kappa\)-centers and balanced \(\kappa\)-weighted centers problems, and logarithmic ratio approximation algorithm for the \(\rho\)- dominating set and the \(k\)-tolerant set problems.

MSC:
68M10 Network design and communication in computer systems
68Q25 Analysis of algorithms and problem complexity
90B18 Communication networks in operations research
PDF BibTeX XML Cite
Full Text: DOI