Impact of Locality on Location Aware Unit Disk Graphs
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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2008-09-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/1/1/2/ |
id |
doaj-00bd45a3326e4faca951895982f82d50 |
---|---|
record_format |
Article |
spelling |
doaj-00bd45a3326e4faca951895982f82d502020-11-25T00:23:16ZengMDPI AGAlgorithms1999-48932008-09-011122910.3390/a1010002Impact of Locality on Location Aware Unit Disk GraphsEvangelos KranakisAndreas WieseDue 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.http://www.mdpi.com/1999-4893/1/1/2/Unit Disk GraphsLocation AwarenessLocal AlgorithmsApproximation AlgorithmsLower Bounds |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Evangelos Kranakis Andreas Wiese |
spellingShingle |
Evangelos Kranakis Andreas Wiese Impact of Locality on Location Aware Unit Disk Graphs Algorithms Unit Disk Graphs Location Awareness Local Algorithms Approximation Algorithms Lower Bounds |
author_facet |
Evangelos Kranakis Andreas Wiese |
author_sort |
Evangelos Kranakis |
title |
Impact of Locality on Location Aware Unit Disk Graphs |
title_short |
Impact of Locality on Location Aware Unit Disk Graphs |
title_full |
Impact of Locality on Location Aware Unit Disk Graphs |
title_fullStr |
Impact of Locality on Location Aware Unit Disk Graphs |
title_full_unstemmed |
Impact of Locality on Location Aware Unit Disk Graphs |
title_sort |
impact of locality on location aware unit disk graphs |
publisher |
MDPI AG |
series |
Algorithms |
issn |
1999-4893 |
publishDate |
2008-09-01 |
description |
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. |
topic |
Unit Disk Graphs Location Awareness Local Algorithms Approximation Algorithms Lower Bounds |
url |
http://www.mdpi.com/1999-4893/1/1/2/ |
work_keys_str_mv |
AT evangeloskranakis impactoflocalityonlocationawareunitdiskgraphs AT andreaswiese impactoflocalityonlocationawareunitdiskgraphs |
_version_ |
1725357961053732864 |