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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
ACCEPT 1representative 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.