Approximation and Kernelization for Chordal Vertex Deletion

@article{Jansen2017ApproximationAK,
  title={Approximation and Kernelization for Chordal Vertex Deletion},
  author={Bart M. P. Jansen and Marcin Pilipczuk},
  journal={SIAM J. Discrete Math.},
  year={2017},
  volume={32},
  pages={2258-2301}
}
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]. 
1
Twitter Mention

References

Publications referenced by this paper.
SHOWING 1-10 OF 51 REFERENCES

Improved results for directed multicut

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Chordal Editing is Fixed-Parameter Tractable

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

(Meta) Kernelization

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Chordal Deletion is Fixed-Parameter Tractable

  • Algorithmica
  • 2006
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…