Parameterized Complexity of Conflict-Free Set Cover. / Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh.
In: Theory of Computing Systems, 12.01.2021.Research output: Contribution to journal › Article › peer-review
Parameterized Complexity of Conflict-Free Set Cover. / Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh.
In: Theory of Computing Systems, 12.01.2021.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Parameterized Complexity of Conflict-Free Set Cover
AU - Jacob, Ashwin
AU - Majumdar, Diptapriyo
AU - Raman, Venkatesh
PY - 2021/1/12
Y1 - 2021/1/12
KW - Fixed parameter tractability
KW - Parameterized complexity
KW - Set cover
KW - W-Hardness
UR - http://www.scopus.com/inward/record.url?scp=85099380041&partnerID=8YFLogxK
U2 - 10.1007/s00224-020-10022-9
DO - 10.1007/s00224-020-10022-9
M3 - Article
AN - SCOPUS:85099380041
JO - Theory of Computing Systems
JF - Theory of Computing Systems
SN - 1432-4350
ER -