Brief announcement: local approximability of minimum dominating set on planar graphs
Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014•dl.acm.org
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.
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.
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.
ACM Digital Library