Impact of locality on location aware unit disk graphs

DOI10.3390/a1010002zbMath1445.90053OpenAlexW2029278215MaRDI QIDQ1662429

Evangelos Kranakis, Andreas Wiese

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

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)

Related Items (1)

Weak models of distributed computing, with connections to modal logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unit disk graphs
• 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
• Distributed Computing: A Locality-Sensitive Approach
• Simple heuristics for unit disk graphs
• What can be computed locally?
• A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
• Graph-Theoretic Concepts in Computer Science
• Approximation and Online Algorithms

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