Connected Feedback Vertex Set in Planar Graphs
- Cite this paper as:
- Grigoriev A., Sitters R. (2010) Connected Feedback Vertex Set in Planar Graphs. In: Paul C., Habib M. (eds) Graph-Theoretic Concepts in Computer Science. WG 2009. Lecture Notes in Computer Science, vol 5911. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.