Brief announcement: local approximability of minimum dominating set on planar graphs

@article{Hilke2014BriefAL,
  title={Brief announcement: local approximability of minimum dominating set on planar graphs},
  author={Miikka Hilke and C. Lenzen and J. Suomela},
  journal={ArXiv},
  year={2014},
  volume={abs/1402.2549}
}
We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a (7-ε)-approximation of a minimum dominating set on planar graphs, for any positive constant ε. In prior work, the best lower bound on the approximation ratio has been 5-ε; there is also an upper bound of 52. 
16 Citations
A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs
  • 3
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
  • 5
Distributed Dominating Set Approximations beyond Planar Graphs
  • 10
  • PDF
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs
  • 3
A Local Constant Factor MDS Approximation for Bounded Genus Graphs
  • 15
  • PDF
Bibliography of distributed approximation beyond bounded degree
  • 2
  • PDF
A local approximation algorithm for minimum dominating set problem in anonymous planar networks
  • W. Wawrzyniak
  • Mathematics, Computer Science
  • Distributed Computing
  • 2015
  • 6
...
1
2
...