Planar F-Deletion: Approximation and Optimal FPT Algorithms

@article{Fomin2012PlanarFA,
title={Planar F-Deletion: Approximation and Optimal FPT Algorithms},
author={Fedor V. Fomin and Daniel Lokshtanov and Neeldhara Misra and Saket Saurabh},
journal={CoRR},
year={2012},
volume={abs/1204.4230}
}

Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex, m-edge graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. F-Deletion is a generic problem and by selecting different sets of forbidden minors F , one can obtain various fundamental problems such as Vertex Cover, Feedback Vertex Set or Treewidth η-Deletion. In this paper we obtain a number of… CONTINUE READING