Document Open Access Logo

PACE Solver Description: UzL Solver for Dominating Set and Hitting Set

Authors Max Bannach , Florian Chudigiewitsch , Marcel Wienöbst

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2025.39.pdf
  • Filesize: 0.56 MB
  • 4 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • exact algorithms
  • dominating set
  • hitting set

Metrics

Abstract

This document contains a short description of our solver for the dominating set and hitting set problems that we submitted to the exact tracks of the PACE Challenge 2025. The solver is based on a straightforward MaxSAT formulation supplemented by hitting-set-based reduction rules. It utilizes a clique solver if the reduced instance is a (small) input for the vertex cover problem and tries to match certain lower bounds by expressing the reduced instance as a sat problem.

Cite As Get BibTex

Max Bannach, Florian Chudigiewitsch, and Marcel Wienöbst. PACE Solver Description: UzL Solver for Dominating Set and Hitting Set. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 39:1-39:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.IPEC.2025.39

Author Details

Max Bannach
  • European Space Agency, AI and Data Science Section, Noordwijk, The Netherlands
Florian Chudigiewitsch
  • Institute for Theoretical Computer Science, University of Lübeck, Germany
Marcel Wienöbst
  • Institute for Theoretical Computer Science, University of Lübeck, Germany

Supplementary Materials

References

  1. Jochen Alber, Michael R Fellows, and Rolf Niedermeier. Polynomial-time data reduction for dominating set. Journal of the ACM (JACM), 51(3):363-384, 2004. URL: https://doi.org/10.1145/990308.990309.
  2. Florent Avellaneda. A short description of the solver EvalMaxSAT. MaxSAT Evaluation, 8:364, 2020. Google Scholar
  3. Armin Biere, Tobias Faller, Katalin Fazekas, Mathias Fleury, Nils Froleyks, and Florian Pollitt. CaDiCaL, Gimsatul, IsaSAT and Kissat entering the SAT Competition 2024. In Proceedings of the SAT Competition 2024 - Solver, Benchmark and Proof Checker Descriptions, pages 8-10, 2024. Google Scholar
  4. Armin Biere, Marijn Heule, and Hans van Maaren. Handbook of satisfiability, volume 185. IOS press, 2009. Google Scholar
  5. M. Ayaz Dzulfikar, Johannes K. Fichte, and Markus Hecher. The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration. In 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), pages 25:1-25:23, 2019. URL: https://doi.org/10.4230/LIPIcs.IPEC.2019.25.
  6. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google Scholar
  7. Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo. Clause redundancy and preprocessing in maximum satisfiability. In Proceedings of the 11th International Joint Conference on Automated Reasoning (IJCAR '22), volume 13385 of Lecture Notes in Computer Science, pages 75-94. Springer, August 2022. URL: https://doi.org/10.1007/978-3-031-10769-6_6.
  8. Janez Konc and Dušanka Janezic. An improved branch and bound algorithm for the maximum clique problem. proteins, 4(5):590-596, 2007. Google Scholar
  9. Tuukka Korhonen, Jeremias Berg, Paul Saikko, and Matti Järvisalo. Clause redundancy and preprocessing in maximum satisfiability. In Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, (SAT '17), volume 10491 of Lecture Notes in Computer Science, pages 449-456. Springer, 2017. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact