Parameterized matroid-constrained maximum coverage

DOI10.4230/LIPICS.ESA.2023.94MaRDI QIDQ6657062zbMATH OpenFDO

Authors

Publication date 6 January 2025

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

zbMATH Keywords

approximate kernelmatroidsmaximum coverage

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back
• Satisfiability to coverage in presence of fairness, matroid, and global constraints
• Maximum unique coverage on streams: improved FPT approximation scheme and tighter space lower bound

This page was built for publication: Parameterized matroid-constrained maximum coverage

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