Efficient construction of low weighted bounded degree planar spanner

International Journal of Computational Geometry and Applications

Volumn 14, Issue 1-2, 2004, Pages 69-84

  Li, Xiang Yang ^a   Wang, Yu ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Bounded degree; Localized algorithm; Low weight; Planar; Spanner

Indexed keywords

EID: 7444238126     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195904001366     Document Type: Conference Paper

References (22)

1. S. Arya, G. Das, D. Mount, J. Salowe and M. Smid, Euclidean spanners: short, thin, and lanky, in Proc. 27th ACM STOC (1995), pp. 489-498.
2. S. Arya, D. M. Mount and M. Smid, Randomized and deterministic algorithms for geometric spanners of small diameter, in Proc. 35th Ann. Symp. Foundations of Computer Science (1994), pp. 703-712.
3. S. Arya and M. Smid, Efficient construction of a bounded degree spanner with low weight, Algorithmica 17 (1997) 33-54.
4. P. Bose, L. Devroye, W. Evans and D. Kirkpatrick, On the spanning ratio of gabriel graphs and beta-skeletons, in Proc. Latin American Theoretical Infocomatics (LATIN) (2002).
5. P. Bose, J. Gudmundsson and P. Morin, Ordered theta graphs, in Proc. Canadian Conf. Computational Geometry (CCCG) (2002).
6. P. Bose, J. Gudmundsson and M. Smid, Constructing plane spanners of bounded degree and low weight, in Proc. European Symp. Algorithms (ESA) (2002).
7. P. Bose and P. Morin, Online routing in triangulations, in Proc. 10th Ann. Int. Symp. Algorithms and Computation ISAAC (1999).
8. B. Chandra, G. Das, G. Narasimhan and J. Soares, New sparseness results on graph spanners, Int. J. Comput. Geom. Appl. 5 (1995) 125-144.
9. G. Das and D. Joseph, Which triangulations approximate the complete graph? in Proc. Int. Symp. Optimal Algorithms (LNCS 401) (1989), pp. 168-192.
10. G. Das and G. Narasimhan, A fast algorithm for constructing sparse euclidean spanners, Int. J. Comput. Geom. Appl. 7(4) (1997) 297-315.
11. D. Dobkin, S. Friedman and K. Supowit, Delaunay graphs are almost as good as complete graphs, Discrete Comput. Geom. (1990).
12. D. Eppstein, Beta-skeletons have unbounded dilation, Int. J. Comput. Geom. Appl. 12(1) (2002) 43-52.
13. K. Gabriel and B. Sokal, A new statistical approach to geographic variation analysis, Syst. Zool. 18 (1969) 259-278.
14. J. Gudmundsson, C. Levcopoulos and G. Narasimhan, Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput. 31(5) (2002) 1479-1500.
15. J. Jaromczyk and G. Toussaint, Relative neighborhood graphs and their relatives, Proc. IEEE 80(9) (1992) 1502-1517.
16. J. Keil and C. Gutwin, The delaunay triangulation closely approximates the complete euclidean graph, in Proc. 1st Workshop Algorithms Data Structure (LNCS 382) (1989).
17. J. M. Keil and C. A. Gutwin, Classes of graphs which approximate the complete euclidean graph, Discrete Comput. Geom. 7 (1992).
18. C. Levcopoulos and A. Lingas, There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees, Algorithmica 8 (1992) 251-256.
19. C. Levcopoulos, G. Narasimhan and M. Smid, Improved algorithms for constructing fault tolerant geometric spanners, Algorithmica (2000).
20. X.-Y. Li, G. Calinescu and P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc wireless networks, in 21st Ann. Joint Conf. IEEE Computer and Communications Societies (INFOCOM) (2002), Vol. 3.
21. T. Lukovszki, New results on fault tolerant geometric spanners, Proc. 6th Workshop on Algorithms an Data Structures (WADS'99), Lecture Notes in Computer Science (1999), pp. 193-204.
22. Y. Wang and X.-Y. and Li, Localized construction of bounded degree planar spanner for wireless networks, in ACM DIALM-POMC Joint Workshop on Foundations of Mobile Computing (2003).