Lossy kernelization for (implicit) hitting set problems

DOI10.4230/LIPICS.ESA.2023.49MaRDI QIDQ6657002zbMATH OpenFDO

Authors Fedor V. Fomin, Le Tien-Nam, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.49

zbMATH Keywords

hitting setlossy kernelization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Data reduction for directed feedback vertex set on graphs without long induced cycles. Three rules to rule them all

This page was built for publication: Lossy kernelization for (implicit) hitting set problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657002)