Impact of locality on location aware unit disk graphs (Q1662429): Difference between revisions

Summary: 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.