Distributed distance-\(r\) covering problems on sparse high-girth graphs
From MaRDI portal
Publication:5918492
DOI10.1016/j.tcs.2022.01.001OpenAlexW4226314890MaRDI QIDQ5918492
Saeed Akhoondian Amiri, Ben Wiederhake
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.001
Cites Work
- Unnamed Item
- Distributed minimum dominating set approximations in restricted families of graphs
- Sparsity. Graphs, structures, and algorithms
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
- On sparse spanners of weighted graphs
- Constant round distributed domination on graph classes with bounded expansion
- A log-star distributed maximal independent set algorithm for growth-bounded graphs
- Local Computation
- Distributed Approximation Algorithms for Planar Graphs
- Fast Distributed Approximations in Planar Graphs
- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
- Locality in Distributed Graph Algorithms
- Approximation algorithms for NP-complete problems on planar graphs
- Distributed Computing: A Locality-Sensitive Approach
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Deterministic Distributed Dominating Set Approximation in the CONGEST Model
- Hardness of Distributed Optimization
- Distributed Maximal Independent Set using Small Messages
- What can be computed locally?
- Fast network decomposition
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
- A Local Constant Factor MDS Approximation for Bounded Genus Graphs
- Distributed Approximation on Power Graphs
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
This page was built for publication: Distributed distance-\(r\) covering problems on sparse high-girth graphs
