Parameterized complexity of conflict-free set cover
From MaRDI portal
Publication:5918356
DOI10.1007/s00224-020-10022-9MaRDI QIDQ5918356
Venkatesh Raman, Diptapriyo Majumdar, Ashwin Jacob
Publication date: 3 August 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-020-10022-9
68Wxx: Algorithms in computer science
68Qxx: Theory of computing
68Uxx: Computing methodologies and applications
05Dxx: Extremal combinatorics