Distributed Almost Exact Approximations for Minor-Closed Families
From MaRDI portal
Recommendations
- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
- Minimum dominating set approximation in graphs of bounded arboricity
- Deterministic distributed dominating set approximation in the CONGEST model
- Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Distributed Approximation Algorithms for Planar Graphs
Cited in
(14)- Local certification of graphs with bounded genus
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor
- Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Simple PTAS's for families of graphs excluding a minor
- Fast Distributed Approximations in Planar Graphs
- Minimum dominating set approximation in graphs of bounded arboricity
- Distributed minimum dominating set approximations in restricted families of graphs
- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
- Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs
- Deterministic distributed dominating set approximation in the CONGEST model
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
- The distributed complexity of locally checkable labeling problems beyond paths and trees
- Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
This page was built for publication: Distributed Almost Exact Approximations for Minor-Closed Families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449532)
