A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs.

Wojciech Wawrzyniak

Published in: Inf. Process. Lett. (2014)

Keyphrases

dominating set
planar graphs
computational complexity
worst case
objective function
dynamic programming
facility location problem
probabilistic model
connected dominating set
linear programming
parameter estimation
closed form
combinatorial optimization
convex hull
directed acyclic graph