Polylogarithmic Approximation for Minimum Planarization (Almost)

In the minimum planarization} problem, given some n-vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves a planar graph. This is a fundamental problem in topological graph theory. We present a \log^{O(1)} n-approximation algorithm for this problem on general graphs with running time n^{O(\log n/\log\log n)}. We… CONTINUE READING

1 Figure or Table