Parameterized approximation scheme for feedback vertex set

DOI10.4230/LIPICS.MFCS.2023.56MaRDI QIDQ6647689zbMATH OpenFDO

Authors Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh

Publication date 3 December 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2023.56

zbMATH Keywords

feedback vertex setparameterized approximation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Nonpartisan feedback vertex set
• Subset feedback vertex set in tournaments as fast as without the subset
• Parameterized complexity of feedback vertex set with connectivity constraints
• Subset feedback vertex set in tournaments as fast as without the subset
• Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems
• Nonpartisan feedback vertex set

This page was built for publication: Parameterized approximation scheme for feedback vertex set

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