Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts
cs.DS, cs.DC
Submitted: 2026-11-01
Updated: 2026-11-01
Code: https://github.com/wwawrzy/paying-for-fractional-error-lean
Terminology
Sources
- Distributed Domination on Graph Classes of Bounded Expansion
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
- Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
- Meta-Theorems for Cuttable Distributed Problems
- Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
- Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
- On distance r-dominating and 2r-independent sets in sparse graphs
- Constant round distributed domination on graph classes with bounded expansion
- Almost tight distributed approximation for domination in sparse graph classes
- Greedy domination on biclique-free graphs
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time