A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Competitive Self-Stabilizing k-Clustering

2012
*
2012 IEEE 32nd International Conference on Distributed Computing Systems
*

In this paper, we propose a silent self-stabilizing asynchronous distributed algorithm for constructing a kclustering of any connected network with unique IDs. Our algorithm stabilizes in O(n) rounds, using O(log n) space per process, where n is the number of processes. In the general case, our algorithm constructs O( n k ) k-clusters. If the network is a Unit Disk Graph (UDG), then our algorithm is 7.2552k +O(1)competitive, that is, the number of k-clusters constructed by the algorithm is at

doi:10.1109/icdcs.2012.72
dblp:conf/icdcs/DattaLDHR12
fatcat:x2ijwcajq5ckhcgjnzqrgvoc7m