Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

Discrete Mathematics, Algorithms and Applications

Volumn 1, Issue 4, 2009, Pages 555-588

  Wiese, Andreas ^a   Kranakis, Evangelos ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

approximation algorithms; coloring; Local algorithms; spanner; unit disk graphs

Indexed keywords

EID: 79960915971     PISSN: 17938309     EISSN: 17938317     Source Type: Journal    
DOI: 10.1142/S1793830909000415     Document Type: Article

References (22)

1. K. Appel and W. Haken, A proof of the four color theorem, Discrete Math. 16 (1976) 179-180.
2. S. Arya, G. Das, D. M. Mount, J. S. Salowe and M. Smid, Euclidean spanners: Short, thin, and lanky, in Proc. Twenty-Seventh Annual ACM Symposium on Theory of Computing, Las Vegas, Nevada, May 29-June 1 (ACM Press, 1995), pp. 489-498.
3. P. Bose, J. Gudmundsson and M. H. M. Smid, Constructing plane spanners of bounded degree and low weight, in ESA, eds. Rolf H. Möhring and Rajeev Raman, Vol. 2461 of LNCS (Springer, 2002), pp. 234-246.
4. P. Bose, P. Morin, I. Stojmenovic and J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, Wireless Networks 7 (2001) 609-616.
5. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho and J. Urrutia, Local construction of planar spanners in unit disk graphs with irregular transmission ranges, in LATIN, eds. Jose R. Correa, Alejandro Hevia, and Marcos A. Kiwi, Vol. 3887 of LNCS (Springer, 2006), pp. 286-297.
6. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165-177.
7. J. Czyzowicz, S. Dobrev, H. Gonzlez-Aguilar, R. Kralovic, E. Kranakis, J. Opatrny, L. Stacho and J. Urrutia, Local 7-coloring for planar subgraphs of unit disk graphs, in Proc. 5th Annual Conference on Theory and Applications of Models of Computation (TAMC08), Xi'an, China, Vol. 4978 (2008).
8. D. Eppstein, Spanning trees and spanners, in Handbook of Computational Geometry, eds. J.-R. Sack and J. Urrutia (Elsevier, 2000).
9. K. R. Gabriel and R. R. Sokal, A new statistical approach to geographic variation analysis, Syst. Zool. 18 (1969) 259-278.
10. A. Gräf, M. Stumpf and G. Weißenfels, On coloring unit disk graphs, Algorithmica 20 (1998) 277-293.
11. N. Linial, Locality in distributed graph algorithms, SIAM J. Comput. 21 (1992) 193-201.
12. N. Li, J. C. Hou and L. Sha, Design and analysis of an mst-based topology control algorithm, in INFOCOM 2003, Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE, Vol. 3 (2003), pp. 1702-1712.
13. X.-Y. Li, G. Calinescu and P.-J.Wan, Distributed construction of planar spanner and routing for ad hoc wireless networks, in Proc. 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), Vol. 3 of Proceedings IEEE INFOCOM 2002, Piscataway, USA (2002), pp. 1268-1277.
14. X.-Y. Li, Y. Wang and W.-Z. Song, Applications of k-Local MST for topology control and broadcasting in wireless ad hoc networks, IEEE Trans. Parall. Distr. Syst. 15 (2004) 1057-1069.
15. X.-Y. Li and Y. Wang, Efficient construction of low weight bounded degree planar spanner, in COCOON, eds. Tandy Warnow and Binhai Zhu, Vol. 2697 of LNCS (Springer, 2003), pp. 374-384.
16. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41 (1994) 960-981.
17. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi and D. J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995) 59-68.
18. R. H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in Graphs and Order (Banff, Alta., 1984), Vol. 147 of NATO, Adv. Sci. Inst. Ser. C Math. Phys. Sci., Reidel, Dordrecht (1985), pp. 41-101.
19. G. Narasimhan and M. Smid, Approximating the stretch factor of Euclidean graphs, SIAM J. Comput. 30 (2000) 978-989.
20. R. Peeters, On coloring j-unit sphere graphs, Technical report, Department of Economics, Tilburg University, 1991.
21. J. Urrutia, Local solutions for global problems in wireless networks, J. Discrete Algorithms 5 (2007) 395-407.
22. Y. Wang and X.-Y. Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks, in DIALM-POMC, ACM (2003), pp. 59-68.