Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
Larsen , xeditor =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
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.
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.