Is there simple reduction Dominating Set to Vertex Cover?In the other direction the reduction is simple.Searching the web returned blog.It warns This is not finished yet and experiments suggestthe reduction doesn't work.Added by simple I mean graph transformation$G \to G'$, s.t. $G$ has DS of size $k$ iff $G'$has VC of size $f(G,k)$ and the transformationdoes not depend on $k$ (to avoid reduction to SAT).
Is there simple reduction Dominating Set to Vertex Cover?
graph theory;reductions