Advertisement

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

  • Bart M. P. JansenEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9224)

Abstract

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system \(\mathcal {F} \) over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in \(\mathcal {F} \). The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vertex set U such that the sets in \(\mathcal {F} \) induce connected subtrees of T. We consider the case that there is a treelike graph with vertex set U such that the sets in \(\mathcal {F} \) induce connected subgraphs; the parameter of the problem is a measure of how treelike the graph is. Our main positive result is an algorithm that, given a graph G with cyclomatic number k, a collection \(\mathcal {P} \) of simple paths in G, and an integer t, determines in time \(2^{5k} (|G| +|\mathcal {P} |)^{{\mathcal {O}}(1)}\) whether there is a vertex set of size t that hits all paths in \(\mathcal {P} \). It is based on a connection to the 2-SAT problem in multiple valued logic. For other parameterizations we derive W[1]-hardness and para-NP-completeness results.

Notes

Acknowledgments

We are grateful to Mark de Berg and Kevin Buchin for interesting discussions that triggered this research.

References

  1. 1.
    Abu-Khzam, F.N.: A kernelization algorithm for d-Hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Béjar, R., Hähnle, R., Manyà, F.: A modular reduction of regular logic to classical logic. In: Proceedings of 31st International Symposium on Multiple-Valued Logic, pp. 221–226 (2001)Google Scholar
  4. 4.
    Bringmann, K., Hermelin, D., Mnich, M., van Leeuwen, E.J.: Parameterized complexity dichotomy for Steiner multicut. In: Proceedings of 32nd STACS, pp. 157–170 (2015)Google Scholar
  5. 5.
    Coppersmith, D., Vishkin, U.: Solving NP-hard problems in ‘almost trees’: vertex cover. Discrete App. Math. 10(1), 27–45 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61(4), 23:1–23:27 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and IDs. ACM Trans. Algorithms 11(2), 13 (2014)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)CrossRefzbMATHGoogle Scholar
  9. 9.
    Fellows, M.R., Jansen, B.M.P., Rosamond, F.: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur. J. Combin. 34(3), 541–566 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Fiala, J., Kloks, T., Kratochvíl, J.J.: Fixed-parameter complexity of \(\lambda \)-labelings. Discrete Appl. Math. 113(1), 59–72 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)zbMATHGoogle Scholar
  12. 12.
    Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. J. Discrete Algorithms 4(4), 608–622 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Jansen, B.M.P.: On structural parameterizations of hitting set: hitting paths in graphs using 2-SAT. CoRR, abs/1507.05890 (2015)Google Scholar
  15. 15.
    Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
  16. 16.
    Lu, M., Liu, T., Tong, W., Lin, G., Xu, K.: Set cover, set packing and hitting set for tree convex and tree-like set systems. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 248–258. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  17. 17.
    Manyà, F.: The 2-SAT problem in signed CNF-formulas. In: Multiple-Valued Logic (2000)Google Scholar
  18. 18.
    Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proceedings of 27th STACS, pp. 17–32 (2010)Google Scholar
  19. 19.
    Trick, M.A.: Induced subtrees of a tree and the set packing problem. Technical Report 377, Institute for Mathematics and Its Applications (1987)Google Scholar
  20. 20.
    Uhlmann, J., Weller, M.: Two-layer planarization parameterized by feedback edge set. Theor. Comput. Sci. 494, 99–111 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Wahlström, M.: Algorithms, measures and upper bounds for satisfiability and related problems. Ph.D. thesis, Linköpings universitet, Sweden (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Eindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations