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.
['Paz Carmi', 'Lilach Chaitman']
Stable Roommates and Geometric Spanners