Abstract
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.
| Original language | English |
|---|---|
| Pages | 31-34 |
| Number of pages | 4 |
| State | Published - 1 Dec 2010 |
| Event | 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 - Winnipeg, MB, Canada Duration: 9 Aug 2010 → 11 Aug 2010 |
Conference
| Conference | 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 |
|---|---|
| Country/Territory | Canada |
| City | Winnipeg, MB |
| Period | 9/08/10 → 11/08/10 |
ASJC Scopus subject areas
- Computational Mathematics
- Geometry and Topology
Fingerprint
Dive into the research topics of 'Stable roommates and geometric spanners'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver