Impact of Locality on Location Aware Unit Disk Graphs
AbstractDue 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
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.Chicago/Turabian Style
Wiese, Andreas; Kranakis, Evangelos. 2008. "Impact of Locality on Location Aware Unit Disk Graphs." Algorithms 1, no. 1: 2-29.