Polynomial-time approximation of independent set parameterized by treewidth

DOI10.4230/LIPICS.ESA.2023.33MaRDI QIDQ6656977zbMATH OpenFDO

Authors Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo

Publication date 6 January 2025

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

zbMATH Keywords

approximation algorithmsmaximum independent setParameterized approximationtreewidth

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Efficient parameterized approximation

This page was built for publication: Polynomial-time approximation of independent set parameterized by treewidth

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