Fixed-parameter algorithms for fair hitting set problems

DOI10.1016/J.IC.2024.105261MaRDI QIDQ7034926zbMATH OpenFDO

Authors Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh

Publication date 31 January 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2024.105261

zbMATH Keywords

fairnesshitting setparameterized complexity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Cites work

• A parameterized view on matroid optimization problems
• Conflict free version of covering problems on graphs: classical and parameterized
• Covering small independent sets and separators with applications to parameterized algorithms
• Deciding first-order properties of nowhere dense graphs
• Deterministic truncation of linear matroids
• Diameter and treewidth in minor-closed graph families
• Efficient computation of representative families with applications in parameterized and exact algorithms
• Fair edge deletion problems
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Parameterized algorithms
• Parameterized complexity of fair deletion problems
• Parameterized complexity of fair vertex evaluation problems
• Reducibility among combinatorial problems

This page was built for publication: Fixed-parameter algorithms for fair hitting set problems

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