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
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2010年 / 5911卷
关键词：
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 条
  • [21] Subset Feedback Vertex Set in Chordal and Split Graphs
    Philip, Geevarghese
    Rajan, Varun
    Saurabh, Saket
    Tale, Prafullkumar
    ALGORITHMICA, 2019, 81 (09) : 3586 - 3629
  • [22] The minimum feedback vertex set for kronecker product of graphs
    Tigrine, Fouad
    Kheddouci, Hamamache
    UTILITAS MATHEMATICA, 2007, 74 : 207 - 237
  • [23] Isomorphism for Graphs of Bounded Feedback Vertex Set Number
    Kratsch, Stefan
    Schweitzer, Pascal
    ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 81 - 92
  • [24] Subset Feedback Vertex Set in Chordal and Split Graphs
    Geevarghese Philip
    Varun Rajan
    Saket Saurabh
    Prafullkumar Tale
    Algorithmica, 2019, 81 : 3586 - 3629
  • [25] Towards optimal kernel for connected vertex cover in planar graphs
    Kowalik, Lukasz
    Pilipczuk, Marcin
    Suchan, Karol
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (7-8) : 1154 - 1161
  • [26] Subset feedback vertex set on graphs of bounded independent set size
    Papadopoulos, Charis
    Tzimas, Spyridon
    THEORETICAL COMPUTER SCIENCE, 2020, 814 : 177 - 188
  • [27] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2020), 2020, 12049 : 286 - 295
  • [28] Feedback vertex set on graphs of low clique-width
    Binh-Minh Bui-Xuan
    Suchy, Ondrej
    Telle, Jan Arne
    Vatshelle, Martin
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (03) : 666 - 679
  • [29] Approximability of the independent feedback vertex set problem for bipartite graphs
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    THEORETICAL COMPUTER SCIENCE, 2021, 849 : 227 - 236
  • [30] Cycles through a prescribed vertex set in N-connected graphs
    Kawarabayashi, K
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (02) : 315 - 323
12345