Efficient construction of low weight bounded degree planar spanner

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2697, Issue , 2003, Pages 374-384

  Li, Xiang Yang ^a   Wang, Yu ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ADJUSTABLE PARAMETERS; BROADCASTING COMMUNICATION; CENTRALIZED ALGORITHMS; DELAU-NAY TRIANGULATIONS; DISTRIBUTED IMPLEMENTATION; EFFICIENT CONSTRUCTION; MINIMUM SPANNING TREES; TWO DIMENSIONAL PLANE;

ARTIFICIAL INTELLIGENCE;

EID: 35248839960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_38     Document Type: Article

References (21)

1. Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. In: Proceedings of European Symposium of Algorithms. (2002)
2. Arya, S., Smid, M.: Efficient construction of a bounded degree spanner with low weight. Algorithmica 17 (1997) 33-54
3. Arya, S., Das, G., Mount, D., Salowe, J., Smid, M.: Euclidean spanners: short, thin, and lanky. In: Proc. 27th ACM STOC. (1995) 489-498
4. Levcopoulos, C., Narasimhan, G., Smid, M.: Improved algorithms for constructing fault tolerant geometric spanners. Algorithmica (2000)
5. Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. In: Proc. 8th Annual ACM Symposium on Computational Geometry. (1992) 192-201
6. Das, G., Narasimhan, G.: A fast algorithm for constructing sparse euclidean spanners. International Journal on Computational Geometry and Applications 7 (1997) 297-315
7. Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Improved greedy algorithms for constructing sparse geometric spanners. In: Scandinavian Workshop on Algorithm Theory. (2000) 314-327
8. Lukovszki, T.: New results on fault tolerant geometric spanners. Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS (1999) 193-204
9. Bose, P., Devroye, L., Evans, W., Kirkpatrick, D.: On the spanning ratio of Gabriel graphs and β-skeletons. In: Proc. of the Latin American Theoretical Infocomatics (LATIN). (2002)
10. Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proceedings of IEEE 80 (1992) 1502-1517
11. Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18 (1969) 259-278
12. Eppstein, D.: β-skeletons have unbounded dilation. Technical Report ICS-TR-96-15, University of California, Irvine (1996)
13. Dobkin, D., Friedman, S., Supowit, K.: Delaunay graphs are almost as good as complete graphs. Discr. Comp. Geom. (1990) 399-407
14. Keil, J., Gutwin, C.: The Delaunay triangulation closely approximates the complete euclidean graph. In: Proc. 1st Workshop Algorithms Data Structure (LNCS 382). (1989)
15. Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete euclidean graph. Discr. Comp. Geom. 7 (1992) 13-28
16. Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Proceedings of International Symposium on Optimal Algorithms (LNCS 401). (1989) 168-192
17. Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica 8 (1992) 251-256
18. Bose, P., Gudmundsson, J., Morin, P.: Ordered θ graphs. In: Proc. of the Canadian Conf. on Computational Geometry (CCCG). (2002)
19. Bose, P., Morin, P.: Online routing in triangulations. In: Proc. of the 10 th Annual Int. Symp. on Algorithms and Computation ISAAC. (1999)
20. Li, X.Y., Wang, Y.: Localized construction of bounded degree planar spanner for wireless networks (2003) Submitted for publication.
21. Li, X.Y., Calinescu, G., Wan, P.J.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: 21st IEEE INFOCOM. Volume 3. (2002)