Impact of locality on location aware unit disk graphs

DOI10.3390/A1010002MaRDI QIDQ1662429zbMATH OpenOpenAlexFDO

Authors Andreas Wiese, Evangelos Kranakis

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a1010002

zbMATH Keywords

lower boundsapproximation algorithmslocal algorithmsunit disk graphslocation awareness

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)

Recommendations

• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
• Analysing local algorithms in location-aware quasi-unit-disk graphs
• Local solutions for global problems in wireless networks
• Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

Cites work

• scientific article; zbMATH DE number 3889282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
• Approximation and Online Algorithms
• Distributed Computing: A Locality-Sensitive Approach
• Graph-Theoretic Concepts in Computer Science
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
• Locality in Distributed Graph Algorithms
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• Simple heuristics for unit disk graphs
• Unit disk graphs
• What can be computed locally?

Cited in

(5)

• Analysing local algorithms in location-aware quasi-unit-disk graphs
• On the locality of bounded growth
• Weak models of distributed computing, with connections to modal logic
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs

This page was built for publication: Impact of locality on location aware unit disk graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662429)