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

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

3 Scopus citations

Abstract

Set Cover is one of the well-known classical NP-hard problems. Following some recent trends, we study the conflict-free version of the Set Cover problem. Here we have a universe U, a family F of subsets of U and a graph G_F on the vertex set F and we look for a subfamily F^′⊆ F of minimum size that covers U and also forms an independent set in G_F. Here we initiate a systematic study of the problem in parameterized complexity by restricting the focus to the variants where Set Cover is fixed-parameter tractable (FPT). We give upper bounds and lower bounds for conflict-free version of the Set Cover with and without duplicate sets along with restrictions to the graph classes of G_F.

Original language	English
Title of host publication	Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings
Editors	René van Bevern, Gregory Kucherov
Publisher	Springer Verlag
Pages	191-202
Number of pages	12
ISBN (Print)	9783030199548
DOIs	https://doi.org/10.1007/978-3-030-19955-5_17
State	Published - 1 Jan 2019
Externally published	Yes
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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Jacob, A., Majumdar, D., & Raman, V. (2019). Parameterized complexity of conflict-free set cover. In R. van Bevern, & G. Kucherov (Eds.), Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings (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 / René van Bevern ; Gregory Kucherov. Springer Verlag, 2019. pp. 191-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1eb47a517ec84f64a3e621fab37b977b,

title = "Parameterized complexity of conflict-free set cover",

abstract = "Set Cover is one of the well-known classical NP-hard problems. Following some recent trends, we study the conflict-free version of the Set Cover problem. Here we have a universe U, a family F of subsets of U and a graph GF on the vertex set F and we look for a subfamily F′⊆ F of minimum size that covers U and also forms an independent set in GF. Here we initiate a systematic study of the problem in parameterized complexity by restricting the focus to the variants where Set Cover is fixed-parameter tractable (FPT). We give upper bounds and lower bounds for conflict-free version of the Set Cover with and without duplicate sets along with restrictions to the graph classes of GF.",

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

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 14th International Computer Science Symposium in Russia, CSR 2019 ; Conference date: 01-07-2019 Through 05-07-2019",

year = "2019",

month = jan,

day = "1",

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

language = "English",

isbn = "9783030199548",

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 = "{van Bevern}, Ren{\'e} and Gregory Kucherov",

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

address = "Germany",

}

Jacob, A, Majumdar, D & Raman, V 2019, Parameterized complexity of conflict-free set cover. in R van Bevern & G Kucherov (eds), Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. 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. / René van Bevern; Gregory Kucherov. 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 › peer-review

TY - GEN

T1 - Parameterized complexity of conflict-free set cover

AU - Jacob, Ashwin

AU - Majumdar, Diptapriyo

AU - Raman, Venkatesh

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Set Cover is one of the well-known classical NP-hard problems. Following some recent trends, we study the conflict-free version of the Set Cover problem. Here we have a universe U, a family F of subsets of U and a graph GF on the vertex set F and we look for a subfamily F′⊆ F of minimum size that covers U and also forms an independent set in GF. Here we initiate a systematic study of the problem in parameterized complexity by restricting the focus to the variants where Set Cover is fixed-parameter tractable (FPT). We give upper bounds and lower bounds for conflict-free version of the Set Cover with and without duplicate sets along with restrictions to the graph classes of GF.

AB - Set Cover is one of the well-known classical NP-hard problems. Following some recent trends, we study the conflict-free version of the Set Cover problem. Here we have a universe U, a family F of subsets of U and a graph GF on the vertex set F and we look for a subfamily F′⊆ F of minimum size that covers U and also forms an independent set in GF. Here we initiate a systematic study of the problem in parameterized complexity by restricting the focus to the variants where Set Cover is fixed-parameter tractable (FPT). We give upper bounds and lower bounds for conflict-free version of the Set Cover with and without duplicate sets along with restrictions to the graph classes of GF.

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 - 9783030199548

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 - van Bevern, René

A2 - Kucherov, Gregory

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 van Bevern R, Kucherov G, editors, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. Springer Verlag. 2019. p. 191-202. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-19955-5_17

Parameterized complexity of conflict-free set cover

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this