Deterministic distributed dominating set approximation in the CONGEST model
From MaRDI portal
Publication:5145186
Recommendations
- Near-optimal distributed approximation of minimum-weight connected dominating set
- Constant-time distributed dominating set approximation
- Constant-time distributed dominating set approximation
- Distributed Almost Exact Approximations for Minor-Closed Families
- An efficient distributed algorithm for constructing small dominating sets
Cited in
(17)- Distributed Dominating Set Approximations beyond Planar Graphs
- Constant-time distributed dominating set approximation
- Distributed Almost Exact Approximations for Minor-Closed Families
- Near-optimal distributed dominating set in bounded arboricity graphs
- Distributed approximation of capacitated dominating sets
- Near-optimal distributed approximation of minimum-weight connected dominating set
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
- Distributed Symmetry Breaking on Power Graphs via Sparsification
- Network Decomposition and Distributed Derandomization (Invited Paper)
- Deterministic distributed ruling sets of line graphs
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
- Minimum dominating set approximation in graphs of bounded arboricity
- Coloring fast without learning your neighbors' colors
- Improved hardness of approximation of diameter in the CONGEST model
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
This page was built for publication: Deterministic distributed dominating set approximation in the CONGEST model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145186)
