Connected Feedback Vertex Set in Planar Graphs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.