Analysing local algorithms in location-aware quasi-unit-disk graphs
From MaRDI portal
(Redirected from Analysing local algorithms in location-aware quasi-unit-disk graphs)
Recommendations
- Impact of locality on location aware unit disk graphs
- 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
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
- Local construction and coloring of spanners of location aware unit disk graphs
Cites work
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs
- A Local 2-Approximation Algorithm for the Vertex Cover Problem
- A simple local 3-approximation algorithm for vertex cover
- Analysing local algorithms in location-aware quasi-unit-disk graphs
- Computing Lightweight Spanners Locally
- Constant-time distributed dominating set approximation
- Cross-layer design of control over wireless networks
- Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)
- Distributed algorithms for \textsc{Edge Dominating Sets}
- Distributed Computing: A Locality-Sensitive Approach
- Fast Distributed Approximations in Planar Graphs
- scientific article; zbMATH DE number 432979 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 2042232 (Why is no real title available?)
- scientific article; zbMATH DE number 3083197 (Why is no real title available?)
- Leveraging Linial’s Locality Limit
- Linear programming without the matrix
- Local 7-coloring for planar subgraphs of unit disk graphs
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
- Local Algorithms for Edge Colorings in UDGs
- Local approximability of max-min and min-max linear programs
- Local construction and coloring of spanners of location aware unit disk graphs
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
- Local edge colouring of Yao-like subgraphs of unit disk graphs
- Local Labeling and Resource Allocation Using Preprocessing
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
- Local solutions for global problems in wireless networks
- Locality in Distributed Graph Algorithms
- Minimum dominating set approximation in graphs of bounded arboricity
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- On the locality of bounded growth
- Survey of local algorithms
- The Densest Packing of 9 Circles in a Square
- The price of being near-sighted
- Unsolved problems in geometry
- What Can be Computed Locally?
- What cannot be computed locally!
Cited in
(7)- Impact of locality on location aware unit disk graphs
- Modem illumination of monotone polygons
- Almost stable matchings by truncating the Gale-Shapley algorithm
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
- Distributed coloring and the local structure of unit-disk graphs
- Distributed coloring and the local structure of unit-disk graphs
- Analysing local algorithms in location-aware quasi-unit-disk graphs
This page was built for publication: Analysing local algorithms in location-aware quasi-unit-disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642985)
