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.
What Can be Computed Locally? , volume =
2 Pith papers cite this work, alongside 317 external citations. Polarity classification is still indexing.
2
Pith papers citing it
317
external citations · OpenAlex
years
2026 2representative citing papers
Indistinguishable fermions generate correlations in quantum networks impossible for bosons or distinguishable particles without additional communication, establishing fermions as fundamentally more nonlocal.
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.
-
Fermions are fundamentally more nonlocal than Bosons
Indistinguishable fermions generate correlations in quantum networks impossible for bosons or distinguishable particles without additional communication, establishing fermions as fundamentally more nonlocal.