A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The Weighted ℱ-Vertex Deletion for a class F of graphs asks, weighted graph G, for a minimum weight vertex set S such that G-S∈ F. The case when F is minor-closed and excludes some graph as a minor has received particular attention but a constant-factor approximation remained elusive for Weighted ℱ-Vertex Deletion. Only three cases of minor-closed F are known to admit constant-factor approximations, namely Vertex Cover, Feedback Vertex Set and Diamond Hitting Set. We study the problem for thearXiv:2105.00857v1 fatcat:gvai3sfc2bcvrewuajt2ckqtg4