A polynomial-time approximation to a minimum dominating set in a graph

Frank Hernandez, Ernesto Parra, Jose Maria Sigarreta +1

A {\em dominating set} of a graph $G=(V,E)$ is a subset of vertices $S\subseteq V$ such that every vertex $v\in V\setminus S$ has at least one neighbor in $S$. Finding a dominating…