Connected Feedback Vertex Set, in Planar Graphs

被引:17
|
作者
Grigoriev, Alexander [1 ]
Sitters, Rene [2 ]
机构
[1] Maastricht Univ, Dept Quantitat Econ, Maastricht, Netherlands
[2] Vrije Univ Amsterdam, Dept Econometr & Operat Res, Amsterdam, Netherlands
关键词
APPROXIMATION ALGORITHMS;
D O I
10.1007/978-3-642-11409-0_13
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present; a polynomial time approximation scheme for both the connected and unconnected version.
引用
收藏
页码:143 / +
页数:3
相关论文
共 50 条