Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem
COCOON, pp. 726-737, 2018.
An l-pseudoforest is a graph each of whose connected component is at most l edges away from being a tree. The l-Pseudoforest Deletion problem is to delete a vertex set P of minimum weight from a given vertex-weighted graph (G=(V,E)) such that the remaining graph (G[Vsetminus P]) is an l-pseudoforest. The Feedback Vertex Set problem is a s...更多
下载 PDF 全文 (上传PDF)