Impact of locality on location aware Unit Disk Graphs

Algorithms

Volumn 1, Issue 1, 2008, Pages 2-29

  Wiese, Andreas ^a   Kranakis, Evangelos ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Local algorithms; Location awareness; Lower bounds; Unit Disk Graphs

Indexed keywords

EID: 79960898825     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a1010002     Document Type: Article

References (18)

1. Dulman, S.; van Hoesel, L.; Nieberg, T.; Havinga, P. Collaborative Communication Protocols for Wireless Sensor Networks. In IEEE ISADS, European Research on Middleware and Architectures for Complex and Embedded Systems Workshop, Pisa, Italy, (April 9-11 2003).
2. Linial, N. Locality in distributed graph algorithms. SIAM J. Comput. 1992, February, 21(1), 193-201.
3. Naor, M.; Stockmeyer, L. What can be computed locally? In STOC '93: Proceedings of the twentyfifth annual ACM symposium on Theory of computing, pages 184-193, New York, NY, USA, 1993. ACM Press.
4. Peleg, D. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
5. Garay, M.; Johnson, D. Computers and Intractability: A Guide to the theory of NP-completeness. Freeman NY, 1979.
6. Raz, R.; Safra, S. A sub-constant error-probability low-degree test, and a sub-constant errorprobability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC '97), pages 475-484, New York, 1997. Association for Computing Machinery.
7. 1-∈. Electronic Colloquium on Computational Complexity (ECCC) 1997, 4(38).
8. Bar-Yehuda, R.; Even, S. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 1985, 25, 27-45.
9. Clark, B. N.; Colbourn, C. J.; Johnson, D. S. Unit disk graphs. Discrete Math. 1990, 86(1-3), 165-177.
10. Marathe, M. V.; Breu, H.; Hunt III, H. B.; Ravi, S. S.; Rosenkrantz, D. J. Simple heuristics for unit disk graphs. Networks 1995, 25(1), 59-68.
11. Hunt III, H. B.; Marathe, M. V.; Radhakrishnan, V.; Ravi, S. S.; Rosenkrantz, D. J.; Stearns, R. E. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms 1998, 26(2), 238-274.
12. Nieberg, T.; Hurink, J. L.; Kern, W. A robust PTAS for maximum weight independent sets in unit disk graphs. In c, J. H.; Nagel, M.;Westfechtel, B., editors, Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, volume 3353 of Lecture Notes in Computer Science, pages 214-221, Berlin, 2004. Springer LNCS.
13. Nieberg, T.; Hurink, J. L. A PTAS for the minimum dominating set problem in unit disk graphs. In Erlebach, T.; Persiano, G., editors, 3rd International Workshop on Approximation and Online Algorithms, WAOA 2005, Palma de Mallorca, Spain, volume 3879 of Lecture Notes in Computer Science, pages 296-306, Heidelberg, Germany, 2006. Springer LNCS.
14. Kuhn, F.; Nieberg, T.; Moscibroda, T.;Wattenhofer, R. Local approximation schemes for ad hoc and sensor networks. In DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pages 97-103, New York, NY, USA, 2005. ACM Press.
15. Gfeller, B.; Vicari, E. A faster distributed approximation scheme for the connected dominating set problem for growth-bounded graphs. In Kranakis, E.; Opatrny, J., editors, ADHOC-NOW, volume 4686 of Lecture Notes in Computer Science, pages 59-73. Springer LNCS, 2007
16. Dai, F.; Wu, J. An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2004, pages 908-920.
17. Czyzowicz, J.; Dobrev, S.; Fevens, T.; González-Aguilar, H.; Kranakis, E.; Opatrny, J.; Urrutia, J. Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. In Laber, E. S.; Bornstein, C. F.; Nogueira, L. T.; Faria, L., editors, LATIN, volume 4957 of Lecture Notes in Computer Science, pages 158-169. Springer, 2008.
18. Wiese, A.; Kranakis, E. Local PTAS for Dominating and Connected Dominating Set in Location Aware UDGs. In 6th Workshop on Approximation and Online Algorithms (WAOA) September 18-19, 2008, Universitaet Karlsruhe, Germany. Springer LNCS, 2008.L. IDHAYAVANI.