Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

COCOON, pp. 726-737, 2018.

被引用0|浏览1
EI

摘要

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...更多

代码

数据

24小时获取PDF
引用
您的评分 :
0

 

标签
评论