The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel for ChVD under the parameterization by the solution size, as well as poly(opt) approximation algorithm. The first result answers an open problem of Marx from 2006 [WG 2006, LNCS 4271, 37-48].
@article{arxiv.1605.03001,
title = {Approximation and Kernelization for Chordal Vertex Deletion},
author = {Bart M. P. Jansen and Marcin Pilipczuk},
journal= {arXiv preprint arXiv:1605.03001},
year = {2016}
}