A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
[article]

2022
*
arXiv
*
pre-print

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 problem is a special case of F-minor-free deletion for the family F = K_5, K_3,3. Whenever the family F contains at least one planar graph, then F-minor-free deletion is known to admit a constant-factor approximation algorithm and a polynomial kernelization [Fomin, Lokshtanov, Misra, and Saurabh, FOCS'12]. The Vertex

arXiv:2202.02174v1
fatcat:56qsslym3nbkxlmrbacnobhbdm