Improved Algorithms for Distributed Balanced Clustering - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2020

Improved Algorithms for Distributed Balanced Clustering

Kian Mirjalali
  • Function : Author
  • PersonId : 1093220
Hamid Zarrabi-Zadeh
  • Function : Author
  • PersonId : 1093221


We study a weighted balanced version of the k-center problem, where each center has a fixed capacity, and each element has an arbitrary demand. The objective is to assign demands of the elements to the centers, so as the total demand assigned to each center does not exceed its capacity, while the maximum distance between centers and their assigned elements is minimized. We present a deterministic O(1)-approximation algorithm for this generalized version of the k-center problem in the distributed setting, where data is partitioned among a number of machines. Our algorithm substantially improves the approximation factor of the current best randomized algorithm available for the problem. We also show that the approximation factor of our algorithm can be improved to $$5+\varepsilon $$, when the underlying metric space has a bounded doubling dimension.
Fichier principal
Vignette du fichier
495613_1_En_6_Chapter.pdf (119.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03165380 , version 1 (10-03-2021)





Kian Mirjalali, Hamid Zarrabi-Zadeh. Improved Algorithms for Distributed Balanced Clustering. 3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.72-84, ⟨10.1007/978-3-030-57852-7_6⟩. ⟨hal-03165380⟩
32 View
12 Download



Gmail Facebook X LinkedIn More