Meta-theorems convert planar-graph α-approximation LOCAL algorithms for cuttable minimization problems into f(g)-round (3α+1)-approximations on bounded-genus graphs, yielding a (34+ε) approximation for MDS that improves prior bounds.
Title resolution pending
2 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
2
Pith papers citing it
2
external citations · OpenAlex
years
2026 2representative citing papers
citing papers explorer
-
Meta-Theorems for Cuttable Distributed Problems
Meta-theorems convert planar-graph α-approximation LOCAL algorithms for cuttable minimization problems into f(g)-round (3α+1)-approximations on bounded-genus graphs, yielding a (34+ε) approximation for MDS that improves prior bounds.
- Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity