Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems

Barış Can Esmer, Ariel Kulik

In this paper we introduce Sampling with a Black Box, a generic technique for the design of parameterized approximation algorithms for vertex deletion problems (e.g., Vertex Cover,…