A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A variant of Vertex Cover
2019
Figshare
Our problem is a variant of the well-known \textsc{Vertex Cover} problem. In our problem, a vertex cover is already given, our task is to decide whether the given solution is optimal, i.e., minimum. This is to show that any purported heuristic algorithm needs something more novel.
doi:10.6084/m9.figshare.7855430.v1
fatcat:hijjh2ikxjea7j4zncmbtq32sm