Parameterized Complexity of Conflict-Free Set Cover

Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman

doi:10.1007/978-3-030-19955-5_17

Parameterized Complexity of Conflict-Free Set Cover

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

302 Downloads (Pure)

Original language	English
Title of host publication	Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings
Editors	Gregory Kucherov, René van Bevern
Publisher	Springer-Verlag
Pages	191-202
Number of pages	12
Volume	11532 LNCS
ISBN (Electronic)	978-3-030-19955-5
ISBN (Print)	978-3-030-19954-8
DOIs	https://doi.org/10.1007/978-3-030-19955-5_17
Publication status	Published - 1 Jul 2019
Event	14th International Computer Science Symposium in Russia, CSR 2019 - Novosibirsk, Russian Federation Duration: 1 Jul 2019 → 5 Jul 2019

Publication series

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

Conference

Conference	14th International Computer Science Symposium in Russia, CSR 2019
Country/Territory	Russian Federation
City	Novosibirsk
Period	1/07/19 → 5/07/19

Keywords

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

Access to Document

10.1007/978-3-030-19955-5_17

Accepted ManuscriptAccepted author manuscript, 365 KB

Cite this

Jacob, A., Majumdar, D., & Raman, V. (2019). Parameterized Complexity of Conflict-Free Set Cover. In G. Kucherov, & R. van Bevern (Eds.), Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings (Vol. 11532 LNCS, pp. 191-202). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11532 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-030-19955-5_17

Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh. / Parameterized Complexity of Conflict-Free Set Cover. Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. editor / Gregory Kucherov ; René van Bevern. Vol. 11532 LNCS Springer-Verlag, 2019. pp. 191-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6105228c7cf74376840b4ae06ca92d4c,

title = "Parameterized Complexity of Conflict-Free Set Cover",

keywords = "Parameterized Complexity, W-hardness, Set Cover, Conflict Free Set Cover, Matroids",

author = "Ashwin Jacob and Diptapriyo Majumdar and Venkatesh Raman",

note = "This work was done when I was in The Institute of Mathematical Sciences, HBNI, Chennai, India.; 14th International Computer Science Symposium in Russia, CSR 2019 ; Conference date: 01-07-2019 Through 05-07-2019",

year = "2019",

month = jul,

day = "1",

doi = "10.1007/978-3-030-19955-5_17",

language = "English",

isbn = "978-3-030-19954-8",

volume = "11532 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "191--202",

editor = "Gregory Kucherov and {van Bevern}, Ren{\'e}",

booktitle = "Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings",

}

Jacob, A, Majumdar, D & Raman, V 2019, Parameterized Complexity of Conflict-Free Set Cover. in G Kucherov & R van Bevern (eds), Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. vol. 11532 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11532 LNCS, Springer-Verlag, pp. 191-202, 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russian Federation, 1/07/19. https://doi.org/10.1007/978-3-030-19955-5_17

Parameterized Complexity of Conflict-Free Set Cover. / Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh.
Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. ed. / Gregory Kucherov; René van Bevern. Vol. 11532 LNCS Springer-Verlag, 2019. p. 191-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11532 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Parameterized Complexity of Conflict-Free Set Cover

AU - Jacob, Ashwin

AU - Majumdar, Diptapriyo

AU - Raman, Venkatesh

N1 - This work was done when I was in The Institute of Mathematical Sciences, HBNI, Chennai, India.

PY - 2019/7/1

Y1 - 2019/7/1

KW - Parameterized Complexity

KW - W-hardness

KW - Set Cover

KW - Conflict Free Set Cover

KW - Matroids

UR - http://www.scopus.com/inward/record.url?scp=85068620709&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-19955-5_17

DO - 10.1007/978-3-030-19955-5_17

M3 - Conference contribution

AN - SCOPUS:85068620709

SN - 978-3-030-19954-8

VL - 11532 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 191

EP - 202

BT - Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings

A2 - Kucherov, Gregory

A2 - van Bevern, René

PB - Springer-Verlag

T2 - 14th International Computer Science Symposium in Russia, CSR 2019

Y2 - 1 July 2019 through 5 July 2019

ER -

Jacob A, Majumdar D, Raman V. Parameterized Complexity of Conflict-Free Set Cover. In Kucherov G, van Bevern R, editors, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. Vol. 11532 LNCS. Springer-Verlag. 2019. p. 191-202. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2019 May 16. doi: 10.1007/978-3-030-19955-5_17

Parameterized Complexity of Conflict-Free Set Cover

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this