Idioma:

How to Allocate Network Centers

Barilan, J. ; Kortsarz, G. ; Peleg, D.

Journal of algorithms, 1993-11, Vol.15 (3), p.385-415 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
How to Allocate Network Centers
Autor: Barilan, J. ; Kortsarz, G. ; Peleg, D.
Assuntos: Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing
É parte de: Journal of algorithms, 1993-11, Vol.15 (3), p.385-415
Descrição: 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.
Editor: San Diego, CA: Elsevier Inc
Idioma: Inglês

Links

Voltar para lista de resultados