Open AccessThis article is
- freely available
Impact of Locality on Location Aware Unit Disk Graphs
Technische Universität Berlin, Institut für Mathematik, Straße des 17. Juni 136, 10623 Berlin, Germany
School of Computer Science, Carleton University 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada
* Authors to whom correspondence should be addressed.
Received: 15 August 2008; Accepted: 4 September 2008 / Published: 12 September 2008
Abstract: Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maximum independent set and minimum vertex cover in location aware Unit Disk Graphs. We also prove the first ever lower bounds for local algorithms for these problems with a given locality in the location aware setting.
Keywords: Unit Disk Graphs; Location Awareness; Local Algorithms; Approximation Algorithms; Lower Bounds
Citations to this Article
Cite This Article
MDPI and ACS Style
Wiese, A.; Kranakis, E. Impact of Locality on Location Aware Unit Disk Graphs. Algorithms 2008, 1, 2-29.
Wiese A, Kranakis E. Impact of Locality on Location Aware Unit Disk Graphs. Algorithms. 2008; 1(1):2-29.
Wiese, Andreas; Kranakis, Evangelos. 2008. "Impact of Locality on Location Aware Unit Disk Graphs." Algorithms 1, no. 1: 2-29.