Connected Feedback Vertex Set in Planar Graphs

  • Alexander Grigoriev
  • René Sitters
Conference paper

DOI: 10.1007/978-3-642-11409-0_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5911)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Alexander Grigoriev
    • 1
  • René Sitters
    • 2
  1. 1.Department of Quantitative EconomicsMaastricht UniversityThe Netherlands
  2. 2.Department of Econometrics and Operations ResearchVU UniversityAmsterdamThe Netherlands

Personalised recommendations