Document Open Access Logo

PACE Solver Description: Shadoks Approach to Minimum Hitting Set and Dominating Set

Authors Guilherme D. da Fonseca , Fabien Feschet , Yan Gerard

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2025.34.pdf
  • Filesize: 0.74 MB
  • 5 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Optimization
  • heuristic
  • hitting set
  • dominating set

Metrics

Abstract

Description of the solvers used by the Shadoks team in the PACE 2025 challenge. The challenge considers solvers for the minimum dominating set and hitting set problems. For the heuristic challenge, we respectively won third and fourth place for hitting set and dominating set. For the exact challenge, we won fifth place on both problems.

Cite As Get BibTex

Guilherme D. da Fonseca, Fabien Feschet, and Yan Gerard. PACE Solver Description: Shadoks Approach to Minimum Hitting Set and Dominating Set. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 34:1-34:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.IPEC.2025.34

Author Details

Guilherme D. da Fonseca
  • LIS, Aix-Marseille Université, France
Fabien Feschet
  • LIMOS, Université Clermont Auvergne, France
Yan Gerard
  • LIMOS, Université Clermont Auvergne, France

Funding

Work supported by the French ANR PRC grant ADDS (ANR-19-CE48-0005).

Acknowledgements

We would like to thank the challenge organizers and other competitors for their time, feedback, and making this whole event possible.

Supplementary Materials

References

  1. Tobias Achterberg. SCIP: solving constraint integer programs. Mathematical Programming Computation, 1(1):1-41, 2009. URL: https://doi.org/10.1007/s12532-008-0001-1.
  2. Florent Avellaneda. A short description of the solver EvalMaxSAT. MaxSAT Evaluation, 8:364, 2020. Google Scholar
  3. Yi Chu, Shaowei Cai, and Chuan Luo. Nuwls: Improving local search for (weighted) partial maxsat by new weighting techniques. In Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, volume 2023, pages 3915-3923, 2023. URL: https://doi.org/10.1609/aaai.v37i4.25505.
  4. Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, and Martin Suda. CaDiCal, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. Artif. Intell., 301:103572, 2021. URL: https://doi.org/10.1016/j.artint.2021.103572.
  5. Alexander Nadel. Anytime algorithms for MaxSAT and beyond. In 2020 Formal Methods in Computer Aided Design (FMCAD), pages 1-1. IEEE, 2020. URL: https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_1.
  6. Lei Shi and Xuan Cai. An exact fast algorithm for minimum hitting set. In 2010 Third International Joint Conference on Computational Science and Optimization, volume 1, pages 64-67. IEEE, 2010. Google Scholar
  7. Etsuji Tomita and Tomokazu Seki. An efficient branch-and-bound algorithm for finding a maximum clique. In Discrete Mathematics and Theoretical Computer Science, pages 278-289, 2003. URL: https://doi.org/10.1007/3-540-45066-1_22.
  8. Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, and Mitsuo Wakatsuki. A simple and faster branch-and-bound algorithm for finding a maximum clique. In International workshop on algorithms and computation, pages 191-203, 2010. URL: https://doi.org/10.1007/978-3-642-11440-3_18.
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