The emergence of sparse spanners and well-separated pair decomposition under anarchy
A spanner graph on a set of points in R<sup><em>d</em></sup> provides shortest paths between any pair of points with lengths at most a constant factor of their Euclidean distance. A spanner with a sparse set of edges is thus a good candidate for network backbones, as desired...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2012-01-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/63 |