Document Open Access Logo

PACE Solver Description: Bad Dominating Set Maker

Authors Alexander Dobler , Simon Dominik Fink , Mathis Rocton

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2025.35.pdf
  • Filesize: 0.56 MB
  • 5 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Dominating Set
  • Hitting Set
  • Pace Challenge

Metrics

Abstract

Dominating Set and Hitting Set are two well-known NP-hard problems on graphs and hypergraphs, respectively. For Dominating Set, we seek a subset S of vertices of minimum size, such that every vertex has a neighbor in S. For Hitting Set, we require that this minimum size subset S intersects each hyperedge. We present Bad Dominating Set Maker, our solver for both problems posed in the exact tracks of the 2025 PACE Challenge. It uses reduction rules, dynamic programming on tree decompositions, and external Vertex Cover and SAT solvers.

Cite As Get BibTex

Alexander Dobler, Simon Dominik Fink, and Mathis Rocton. PACE Solver Description: Bad Dominating Set Maker. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 35:1-35:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.IPEC.2025.35

Author Details

Alexander Dobler
  • Algorithms and Complexity Group, TU Wien, Austria
Simon Dominik Fink
  • Algorithms and Complexity Group, TU Wien, Austria
Mathis Rocton
  • Algorithms and Complexity Group, TU Wien, Austria

Funding

  • Dobler, Alexander: Vienna Science and Technology Fund (WWTF) grant [10.47379/ICT19035].
  • Fink, Simon Dominik: Vienna Science and Technology Fund (WWTF) grant [10.47379/ICT22029] and Austrian Science Fund (FWF) grant [10.55776/Y1329].
  • Rocton, Mathis: European Union’s Horizon 2020 research and innovation COFUND programme (LogiCS@TUWien, grant agreement No 101034440).

Supplementary Materials

References

  1. Michael Abseher, Nysret Musliu, and Stefan Woltran. htd - A free, open-source framework for (customized) tree decompositions and beyond. In Proc. Integration of AI and OR Techniques in Constraint Programming (CPAIOR'2017), volume 10335 of LNCS, pages 376-386. Springer, 2017. https://github.com/mabseher/htd. URL: https://doi.org/10.1007/978-3-319-59776-8_30.
  2. Florent Avellaneda. Evalmaxsat 2023. MaxSAT Evaluation 2023, page 12, 2023. URL: https://github.com/FlorentAvellaneda/EvalMaxSAT.
  3. Alexander Dobler, Simon Dominik Fink, and Mathis Rocton. The (not-so) Bad Dominating Set Maker. Software, Vienna Science and Technology Fund (WWTF) grant [10.47379/ICT19035], Vienna Science and Technology Fund (WWTF) grant [10.47379/ICT22029], European Union’s Horizon 2020 research and innovation COFUND programme (LogiCS@TUWien, grant agreement No 101034440), Austrian Science Fund (FWF) grant [10.55776/Y1329], (visited on 2025-12-05). URL: https://github.com/Doblalex/pace2025
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.25245
  4. John Hopcroft and Robert Tarjan. Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM, 16(6):372-378, June 1973. URL: https://doi.org/10.1145/362248.362272.
  5. Robert Paige and Robert Endre Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, 1987. URL: https://doi.org/10.1137/0216062.
  6. Patrick Prosser and James Trimble. Peaty: an exact solver for the vertex cover problem, 2019. URL: https://github.com/jamestrimble/peaty.
  7. Johan M. M. van Rooij and Hans L. Bodlaender. Exact algorithms for dominating set. Discret. Appl. Math., 159(17):2147-2164, 2011. URL: https://doi.org/10.1016/J.DAM.2011.07.001.
  8. Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, and Martin Vatshelle. Fast dynamic programming on graph decompositions. CoRR, abs/1806.01667, 2018. URL: https://arxiv.org/abs/1806.01667.
  9. Lutz Volkmann. A reduction principle concerning minimum dominating sets in graphs. J. Comb. Math. Comb. Comp., 31:85-90, 1999. Google Scholar
  10. Ziliang Xiong and Mingyu Xiao. Exactly solving minimum dominating set and its generalization. In Proc. Conference on Artificial Intelligence, (IJCAI'2024), pages 7056-7064. ijcai.org, 2024. URL: https://www.ijcai.org/proceedings/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