TY - GEN
T1 - Communication-efficient construction of the plane localized Delaunay graph
AU - Bose, Prosenjit
AU - Carmi, Paz
AU - Smid, Michiel
AU - Xu, Daming
N1 - Funding Information:
This work was supported by the Natural Sciences and Engineering Research Council of Canada.
PY - 2010/6/18
Y1 - 2010/6/18
N2 - 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 . Each node can only communicate with nodes that are within unit-distance from it. This algorithm only makes one round of communication and each point of V broadcasts at most 5 messages. This improves on all previously known message-bounds for this problem.
AB - 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 . Each node can only communicate with nodes that are within unit-distance from it. This algorithm only makes one round of communication and each point of V broadcasts at most 5 messages. This improves on all previously known message-bounds for this problem.
UR - http://www.scopus.com/inward/record.url?scp=77953507651&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-12200-2_26
DO - 10.1007/978-3-642-12200-2_26
M3 - Conference contribution
AN - SCOPUS:77953507651
SN - 3642121993
SN - 9783642121999
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 282
EP - 293
BT - LATIN 2010
T2 - 9th Latin American Theoretical Informatics Symposium, LATIN 2010
Y2 - 19 April 2010 through 23 April 2010
ER -