Document Open Access Logo

PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems

Author Sylwester Swat

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2025.38.pdf
  • Filesize: 0.51 MB
  • 4 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
Keywords
  • dominating set
  • hitting set
  • exact algorithms
  • heuristic algorithms
  • large graphs
  • combinatorial optimization

Metrics

Abstract

This article briefly describes the most important algorithms and techniques used in HitS&DoSeS, a dominating set and hitting set solver submitted to the PACE 2025 contest (10th Parameterized Algorithms and Computational Experiments Challenge). Used approaches for the exact and heuristic tracks are described, for both the dominating set and the hitting set problems.

Cite As Get BibTex

Sylwester Swat. PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 38:1-38:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.IPEC.2025.38

Author Details

Sylwester Swat
  • Institute of Computing Science, Poznan University of Technology, Poland

Funding

This research received funding from the National Science Centre, Poland (grant No. 2023/49/N/ST6/02506, PI: Sylwester Swat).

Supplementary Materials

References

  1. Jochen Alber, Michael Fellows, and Rolf Niedermeier. Polynomial time data reduction for dominating set. Journal of the ACM, 51, May 2004. URL: https://doi.org/10.1145/990308.990309.
  2. Gilles Audemard and Laurent Simon. Predicting learnt clauses quality in modern sat solvers. In IJCAI'09: Proceedings of the 21st International Joint Conference on Artificial Intelligence, pages 399-404, July 2009. URL: http://ijcai.org/Proceedings/09/Papers/074.pdf.
  3. Armin Biere, Tobias Faller, Katalin Fazekas, Mathias Fleury, Nils Froleyks, and Florian Pollitt. CaDiCaL 2.0. In Computer Aided Verification - 36th International Conference, CAV 2024, Montreal, QC, Canada, July 24-27, 2024, Proceedings, Part I, volume 14681 of Lecture Notes in Computer Science, pages 133-152. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-65627-9_7.
  4. Suresh Bolusani, Mathieu Besançon, Ksenia Bestuzheva, Antonia Chmiela, João Dionísio, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Mohammed Ghannam, Ambros Gleixner, Christoph Graczyk, Katrin Halbig, Ivo Hedtke, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Dominik Kamp, Thorsten Koch, Kevin Kofler, Jurgen Lentz, Julian Manns, Gioni Mexi, Erik Mühmer, Marc E. Pfetsch, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Mark Turner, Stefan Vigerske, Dieter Weninger, and Lixing Xu. The SCIP Optimization Suite 9.0. ZIB-Report 24-02-29, Zuse Institute Berlin, February 2024. URL: https://nbn-resolving.org/urn:nbn:de:0297-zib-95528.
  5. Shaowei Cai and Kaile Su. Configuration checking with aspiration in local search for sat. Proceedings of the AAAI Conference on Artificial Intelligence, 26(1):434-440, September 2021. URL: https://doi.org/10.1609/aaai.v26i1.8133.
  6. Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM, 50(5):752-794, September 2003. URL: https://doi.org/10.1145/876638.876643.
  7. Q. Huangfu and Julian Hall. Parallelizing the dual revised simplex method. Mathematical Programming Computation, 10, March 2015. URL: https://doi.org/10.1007/s12532-017-0130-5.
  8. Alexey Ignatiev, Antonio Morgado, and Joao Marques-Silva. Rc2: an efficient maxsat solver. Journal on Satisfiability, Boolean Modeling and Computation, 11:53-64, September 2019. URL: https://doi.org/10.3233/SAT190116.
  9. Laurent Perron and Frédéric Didier. CP-SAT. URL: https://developers.google.com/optimization/cp/cp_solver/.
  10. Laurent Perron and Vincent Furnon. OR-Tools. URL: https://developers.google.com/optimization/.
  11. Enqiang Zhu, Yu Zhang, Shengzhi Wang, Darren Strash, and Chanjuan Liu. A dual-mode local search algorithm for solving the minimum dominating set problem. CoRR, July 2023. URL: https://doi.org/10.48550/arXiv.2307.16815.
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