On Spanners and Lightweight Spanners of Geometric Graphs

@article{Kanj2010OnSA,
  title={On Spanners and Lightweight Spanners of Geometric Graphs},
  author={Iyad A. Kanj and Ljubomir Perkovic and Ge Xia},
  journal={SIAM J. Comput.},
  year={2010},
  volume={39},
  pages={2132-2161}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Delaunay Graphs are almost as Good as Complete Graphs

Discrete & Computational Geometry • 1990
View 2 Excerpts
Highly Influenced

Geometric Spanner Networks

G. Narasimhan, M. Smid
Cambridge University Press, Cambridge, UK • 2007
View 3 Excerpts

Similar Papers

Loading similar papers…