Parameterized Complexity of Conflict-Free Set Cover

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

259 Downloads (Pure)
Original languageEnglish
Title of host publicationComputer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings
EditorsGregory Kucherov, René van Bevern
PublisherSpringer-Verlag
Pages191-202
Number of pages12
Volume11532 LNCS
ISBN (Electronic)978-3-030-19955-5
ISBN (Print)978-3-030-19954-8
DOIs
Publication statusPublished - 1 Jul 2019
Event14th International Computer Science Symposium in Russia, CSR 2019 - Novosibirsk, Russian Federation
Duration: 1 Jul 20195 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11532 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Computer Science Symposium in Russia, CSR 2019
Country/TerritoryRussian Federation
CityNovosibirsk
Period1/07/195/07/19

Keywords

  • Parameterized Complexity
  • W-hardness
  • Set Cover
  • Conflict Free Set Cover
  • Matroids

Cite this