Abstract
Set Cover is one of the well-known classical NP-hard problems. We study the conflict-free version of the Set Cover problem. Here we have a universe \(\mathcal {U}\), a family \(\mathcal {F}\) of subsets of \(\mathcal {U}\) and a graph \(G_{\mathcal {F}}\) on the vertex set \(\mathcal {F}\) and we look for a subfamily \(\mathcal {F}^{\prime } \subseteq \mathcal {F}\) of minimum size that covers \(\mathcal {U}\) and also forms an independent set in \(G_{\mathcal {F}}\). We study conflict-free Set Cover 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 the running time of conflict-free version of Set Cover with and without duplicate sets along with restrictions to the graph classes of \(G_{\mathcal {F}}\). For example, when pairs of sets in \(\mathcal {F}\) intersect in at most one element, for a solution of size k, we give
-
an \(f(k)|\mathcal {F}|^{o(k)}\) lower bound for any computable function f assuming ETH even if \(G_{\mathcal {F}}\) is bipartite, but
-
an \(O^{*}(3^{k^{2}})\) FPT algorithm (\(\mathcal {O}^{*}\) notation ignores polynomial factors of input) when \(G_{\mathcal {F}}\) is chordal.
Similar content being viewed by others
References
Agrawal, A., Jain, P., Kanesh, L., Lokshtanov, D., Saurabh, S.: Conflict free feedback vertex set: a parameterized dichotomy. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)
Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S., Simakov, M.: Choice is hard. In: International Symposium on Algorithms and Computation, pp 318–328. Springer (2015)
Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S., Simakov, M.: Conflict-free covering. In: Conference on Computational Geometry, p 17 (2015)
Arkin, E.M., Hassin, R.: Minimum-diameter covering problems. Networks: An International Journal 36(3), 147–155 (2000)
Banik, A., Panolan, F., Raman, V., Sahlot, V.: Fréchet distance between a line and avatar point set. Algorithmica 80(9), 2616–2636 (2018)
Banik, A., Panolan, F., Raman, V., Sahlot, V., Saurabh, S.: Parameterized complexity of geometric covering problems having conflicts. Algorithmica 82(1), 1–19 (2020)
Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S., Wahlström, M.: On problems as hard as CNF-SAT. ACM Transactions on Algorithms (TALG) 12(3), 41 (2016)
Cygan, M., Fomin, F.V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)
Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159 (16), 1726–1735 (2011)
Diestel, R.: Graph Theory. Springer, Berlin (2006)
Epstein, L., Favrholdt, L.M., Levin, A.: Online variable-sized bin packing with conflicts. Discret. Optim. 8(2), 333–343 (2011)
Even, G., Halldórsson, M.M., Kaplan, L., Ron, D.: Scheduling with conflicts: online and offline algorithms. Journal of Scheduling 12(2), 199–224 (2009)
Farber, M.: On diameters and radii of bridged graphs. Discret. Math. 73(3), 249–260 (1989)
Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp 245–256. Springer (2004)
Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM (JACM) 63(4), 29 (2016)
Golumbic, M.C: Algorithmic graph theory and perfect graphs. Annals of Discrete Mathematics 57 (2004)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences (JCSS) 63(4), 512–530 (2001)
Jacob, A., Majumdar, D., Raman, V.: Parameterized complexity of conflict-free set cover. In: International Computer Science Symposium in Russia, pp 191–202. Springer (2019)
Jain, P., Kanesh, L., Misra, P.: Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst. 64(6), 1067–1093 (2020). https://doi.org/10.1007/s00224-019-09964-6
Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119–123 (1988)
Kann, V.: Polynomially bounded minimization problems which are hard to approximate. In: International Colloquium on Automata, Languages, and Programming, pp 52–63. Springer (1993)
Kloks, T.: Treewidth: Computations and Approximations, vol. 842. Springer Science & Business Media, Berlin (1994)
Kumar, V.S.A., Arya, S., Ramesh, H.: Hardness of set cover with intersection 1. In: Rolim, J.D.P., Welzl, E. (eds.) Automata, Languages and Programming, pp 624–635. Springer, Berlin (2000)
Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. SIAM J. Comput. 47(3), 675–702 (2018)
Lokshtanov, D., Misra, P., Panolan, F., Saurabh, S.: Deterministic truncation of linear matroids. ACM Transactions on Algorithms (TALG) 14(2), 14 (2018)
Lokshtanov, D., Panolan, F., Saurabh, S., Sharma, R., Zehavi, M.: Covering small independent sets and separators with applications to parameterized algorithms. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 2785–2800. Society for Industrial and Applied Mathematics (2018)
Marx, D.: A parameterized view on matroid optimization problems. Theor. Comput. Sci. 410(44), 4471–4479 (2009)
Marx, D., Salmasi, A., Sidiropoulos, A.: Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, vol. 60 of LIPIcs, pp 16:1–16:54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
Nešetřil, J., De Mendez, P.O.: On nowhere dense graphs. Eur. J. Comb. 32(4), 600–617 (2011)
Oxley, J.G.: Matroid Theory, vol. 3. Oxford University Press, USA (2006)
Pferschy, U., Schauer, J.: The maximum flow problem with conflict and forcing conditions. In: Network Optimization, pp 289–294. Springer (2011)
Pferschy, U., Schauer, J.: Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33(4), 1300–1323 (2017)
Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)
van Bevern, R., Tsidulko, O.Y., Zschoche, P.: Fixed-parameter algorithms for maximum-profit facility location under matroid constraints. In: International Conference on Algorithms and Complexity, pp 62–74. Springer (2019)
Acknowledgements
The authors thank Fahad Panolan and Saket Saurabh for several valuable discussions on the theme of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary version appeared in the proceedings of CSR 2019 [18].
This article belongs to the Topical Collection: Special Issue on Computer Science Symposium in Russia (2019)
Guest Editor: Gregory Kucherov
Rights and permissions
About this article
Cite this article
Jacob, A., Majumdar, D. & Raman, V. Parameterized Complexity of Conflict-Free Set Cover. Theory Comput Syst 65, 515–540 (2021). https://doi.org/10.1007/s00224-020-10022-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-020-10022-9