Document Open Access Logo

PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem

Authors Jona Dirks , Enna Gerhard , Victoria Kaial , Lucas Lorieau

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2025.33.pdf
  • Filesize: 0.61 MB
  • 4 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • complexity theory
  • parameterized complexity
  • linear programming
  • java
  • dominating set
  • PACE 2025

Metrics

Abstract

We present and describe the solver OBLX for the Dominating Set problem on graphs. This solver was developed during the PACE challenge 2025 for the Exact track. It first applies several data reduction rules and performs a polynomial time reduction to Max Sat. The resulting Max Sat instance is in turn solved using the EvalMaxSat solver by Florent Avellaneda.

Cite As Get BibTex

Jona Dirks, Enna Gerhard, Victoria Kaial, and Lucas Lorieau. PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 33:1-33:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.IPEC.2025.33

Author Details

Jona Dirks
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Enna Gerhard
  • University of Bremen, Bibliothekstraße 5, 28359 Bremen, Germany
Victoria Kaial
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Lucas Lorieau
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France

Funding

  • Lorieau, Lucas: This author has received financial support from the CNRS through the MITI inter-disciplinary programs and the IRL ReLaX.

Supplementary Materials

References

  1. Florent Avellaneda. A short description of the solver EvalMaxSAT, 2020. URL: https://hdl.handle.net/10138/318451.
  2. Moritz Bergenthal, Jona Dirks, Thorben Freese, Jakob Gahde, Enna Gerhard, Mario Grobler, and Sebastian Siebertz. PACE Solver Description: GraPA-JAVA. In IPEC 2022, volume 249 of LIPIcs, pages 30:1-30:4, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.IPEC.2022.30.
  3. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-21275-3.
  4. Jona Dirks, Enna Gerhard, Victoria Kaial, and Lucas Lorieau. OBLX. Software, (visited on 2025-12-04). URL: https://gitlab.limos.fr/oblx/public
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.25239
  5. Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, and Maximilian Sonneborn. PACE Solver Description: PACA-JAVA. In IPEC 2021, volume 214 of LIPIcs, pages 30:1-30:4, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.IPEC.2021.30.
  6. Enna Gerhard and Sebastian Siebertz. Solving the Directed Feedback Vertex Set Problem in Theory and Practice, 2024. URL: https://doi.org/10.26092/elib/4916.
  7. Ziliang Xiong and Mingyu Xiao. Exactly Solving Minimum Dominating Set and Its Generalization. IJCAI-24, 2024. URL: https://doi.org/10.24963/ijcai.2024/780.
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