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

BC Esmer, A Kulik - arXiv preprint arXiv:2407.12654, 2024 - arxiv.org
In this paper we introduce Sampling with a Black Box, a generic technique for the design of
parameterized approximation algorithms for vertex deletion problems (eg, Vertex Cover …

[PDF][PDF] Parameterized Algorithms for Augmented Graph Problems

SK Roy - 2024 - research.tue.nl
The cover design of this thesis incorporates three main elements that are closely related to
its content. Firstly, sunflowers are used to symbolize the Sunflower lemma, a key technical …