A local constant factor approximation for the minimum dominating set problem on bounded genus graphs

@article{Amiri2016ALC,
  title={A local constant factor approximation for the minimum dominating set problem on bounded genus graphs},
  author={Saeed Akhoondian Amiri and Stefan Schmid and Sebastian Siebertz},
  journal={CoRR},
  year={2016},
  volume={abs/1602.02991}
}
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, several breakthroughs have been made on computing local approximations on… CONTINUE READING