Stable roommates and geometric spanners

In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph and Yao-Yao graph, and as such it can be computed in a distributed manner and has a bounded degree as the Yao-Yao graph, while on the other hand, it has the same stretch factor bound as the Yao graph.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Paz Carmi, Lilach Chaitman
• Keywords: CCCG 2010, Computational Geometry, Stable Roommates, Yao Graph, Yao-Yao Graph