Stable Roommates Spanner

Authors:
Prosenjit Bose;Paz Carmi;Lilach Chaitman-Yerushalmi;SéBastien Collette;Matthew J. Katz;Stefan Langerman
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Département dInformatique, Université Libre de Bruxelles, Brussels, Belgium;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Département dInformatique, Université Libre de Bruxelles, Brussels, Belgium
Venue:
Computational Geometry: Theory and Applications
Year:
2013

Citing 7
Cited 0

Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

SIAM Journal on Computing
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Geometric Spanner Networks

Geometric Spanner Networks
Geometric stable roommates

Information Processing Letters
Yao graphs span theta graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new geometric spanner whose construction is based on a generalization of the known Stable Roommates problem. The Stable Roommates Spanner combines the most desirable properties of geometric spanners: a natural definition, small degree, linear number of edges, strong (1+@e)-spanner for every @e0, and an efficient construction algorithm. It is an improvement over the well-known Yao graph and @Q-graph and their variants. We show how to construct such a spanner for a set of points in the plane in O(nlog^1^0n) expected time. We introduce a variant of the Stable Roommates Spanner called the Stable Roommates @Q-Spanner which we can generalize to higher dimensions and construct more efficiently in O(nlog^dn) time. This variant possesses all the properties of the Stable Roommates Spanner except that it is no longer a strong spanner.