Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion

Bart M. P. Jansen, Michał Włodarczyk

In the F-minor-free deletion problem we want to find a minimum vertex set in a given graph that intersects all minor models of graphs from the family F. The Vertex planarization pr…