How to allocate network centers

Judit Bari-Lan, Guy Kortsarz, David Peleg

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

ملخص

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.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)385-415
عدد الصفحات31
دوريةJournal of Algorithms
مستوى الصوت15
رقم الإصدار3
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - نوفمبر 1993
منشور خارجيًانعم

بصمة

أدرس بدقة موضوعات البحث “How to allocate network centers'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا