5-approximation for H-treewidth essentially as fast as H-deletion parameterized by solution size

DOI10.4230/LIPICS.ESA.2023.66MaRDI QIDQ6657028zbMATH OpenFDO

Authors Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk

Publication date 6 January 2025

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

zbMATH Keywords

fixed-parameter tractabilitygraph decompositionstreewidth

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• FPT approximations for packing and covering problems parameterized by elimination distance and even less
• Steiner tree parameterized by multiway cut and even less

This page was built for publication: 5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size

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