Algorithms 2008, 1(1), 2-29; doi:10.3390/a1010002
Article

Impact of Locality on Location Aware Unit Disk Graphs

Received: 15 August 2008; Accepted: 4 September 2008 / Published: 12 September 2008
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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
PDF Full-text Download PDF Full-Text [276 KB, uploaded 27 September 2008 18:28 CEST]

Export to BibTeX |
EndNote


MDPI and ACS Style

Wiese, A.; Kranakis, E. Impact of Locality on Location Aware Unit Disk Graphs. Algorithms 2008, 1, 2-29.

AMA Style

Wiese A, Kranakis E. Impact of Locality on Location Aware Unit Disk Graphs. Algorithms. 2008; 1(1):2-29.

Chicago/Turabian Style

Wiese, Andreas; Kranakis, Evangelos. 2008. "Impact of Locality on Location Aware Unit Disk Graphs." Algorithms 1, no. 1: 2-29.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert