Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4π√3 9-spanner of the unit-disk graph UDG(V). This algorithm makes only one round of communication and each point of V broadcasts at most 5 messages. This improves the previously best message-bound of 11 by Araújo and Rodrigues (Fas
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.