On spanners and lightweight spanners of geometric graphs
Downloadable Content
Abstract
- We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructing efficient and reliable wireless network communication topologies. We study the above problem under two computational models: the centralized and the distributed model. In the distributed model we focus on algorithms that are local. Such algorithms are suitable for the relevant applications (e.g., wireless computing). Under the centralized model, we present an O(n lg n) time algorithm that computes a bounded-degree plane spanner of a complete Euclidean graph, where n is the number of points in the graph. Both upper bounds on the degree and the stretch factor significantly improve the previous bounds. We extend this algorithm to compute a bounded-degree plane lightweight spanner of a complete Euclidean graph. Under the distributed model, we give the first local algorithm for computing a spanner of a unit disk graph that is of bounded degree and plane. The upper bounds on the degree, stretch factor, and the locality of the algorithm dramatically improve the previous results, as shown in the paper. This algorithm can also be extended to compute a bounded-degree plane lightweight spanner of a unit disk graph. Our algorithms rely on structural and geometric results that we develop in this paper.
Title | On spanners and lightweight spanners of geometric graphs |
---|---|
Creator | Kanj, I. A. |
Perkovic, L. | |
Xia, Ge | |
Publisher | SIAM Journal on Computing |
Academic Department | Computer Science |
Division | Natural Sciences |
Organization | Lafayette College |
Date Issued | 2010 |
Date Available | 2010-05-28T13:49:15Z |
Type | Article |
Language | English |
Keyword | lightweight |
unit disk graphs | |
Delaunay triangulations | |
local distributed algorithms | |
spanners | |
bounded degree | |
Bibliographic Citation | Kanj, I. A., L. Perkovic, and G. Xia. (2010.) "On spanners and lightweight spanners of geometric graphs." SIAM Journal on Computing 39 (6): 2132-2161. |
Standard Identifier | DOI 10.1137/080737708 |
Handle 10385/670 | |
Permalink | http://hdl.handle.net/10385/670 |
Rights Statement | In Copyright |
Rights Holders | Society for Industrial and Applied Mathematics |
Contains
File | Xia-SiamJournalonComputing-vol39-2010.pdf | Uploaded 2019-10-20 | Public | Download |