A Self-Stabilizing O(k)-Time k-Clustering Algorithm

A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with unique IDs and no designated leader. The algorithm is comparison-based, takes O(k) time and uses O(k log n) space per process, where n is the size of the network. It is known that finding a minimal k-dominating set is NP-hard. A lower bound is given, showing that no comparison-based algorithm for the k-clustering problem that takes o(diam) rounds can approximate the optimal solution, where diam is the diameter of the network.

• Type: Journal
• Year: 2010
• Where: CJ
• Authors: Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
• Keywords: Asynchronous Distributed Algorithms, CJ 2010, Connected Network, Unique Ids