Document Open Access Logo

PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth

Authors Max Bannach , Sebastian Berndt

PDF
Thumbnail PDF

File

LIPIcs.IPEC.2023.35.pdf
  • Filesize: 0.86 MB
  • 14 pages

Document Identifiers

Author Details

Max Bannach
  • European Space Agency, Advanced Concepts Team, Noordwijk, The Netherlands
Sebastian Berndt
  • Institute for Theoretical Computer Science, University of Lübeck, Germany

Acknowledgements

The prize money (€4000) was generously provided by Networks, an NWO Gravitation project of the University of Amsterdam, Eindhoven University of Technology, Leiden University and the Center for Mathematics and Computer Science (CWI). We are grateful to the whole optil.io team, led by Szymon Wasik, and especially to Jan Badura and Artur Laskowski for the fruitful collaboration and for hosting the competition at the optil.io online judge system. We also thank André Schidler and Stefan Szeider, who made their exact solver available to the organizers prior to the competition for internal evaluations [André Schidler and Stefan Szeider, 2022].

Cite AsGet BibTex

Max Bannach and Sebastian Berndt. PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 35:1-35:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.IPEC.2023.35

Abstract

This article is a report by the challenge organizers on the 8th Parameterized Algorithms and Computational Experiments Challenge (PACE 2023). As was common in previous iterations of the competition, this year’s iteration implemented an exact and heuristic track for a parameterized problem that has gained attention in the theory community. This year, the problem was to compute the twinwidth of a graph, a recently introduced width parameter that measures the similarity of a graph to a cograph. In the exact track, the competition participants were asked to develop an exact algorithm that can solve as many instances as possible from a benchmark set of 100 instances - with a time limit of 30 minutes per instance. The same task must be accomplished within 5 minutes in the heuristic track. However, the result in this track is not required to be optimal. As in previous iterations, the organizers handed out awards to the best solutions in both tracks and to the best student submissions. New this year is a dedicated theory award that appreciates new theoretical insights found by the participants during the development of their tools.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Twinwidth
  • Algorithm Engineering
  • FPT
  • Kernelization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Barla Adam, Blažej Václav, Červený Radovan, Dvořák Michal, Knop Dušan, Koleda Jozef, Pokorný Jan, Šťastný Petr, and Suchý Ondřej. G2oat solver for pace 2023 (twinwidth) exact track, June 2023. URL: https://doi.org/10.5281/zenodo.7997817.
  2. Sachin Agarwal, Aman Jain, Talika Gupta, and Srinibas Swain. Hatter: Hybrid approach to twinwidth by taming red, June 2023. URL: https://doi.org/10.5281/zenodo.8045969.
  3. Andrei Arhire and Matei Chiriac. Uaic_twin_width: An exact twin-width algorithm, June 2023. URL: https://doi.org/10.5281/zenodo.8010483.
  4. Jonathan Balasingham, Sebastian Wild, and Viktor Zamaraev. Pace-2023, May 2023. URL: https://doi.org/10.5281/zenodo.7996417.
  5. Tomas Balyo, Marijn Heule, Markus Iser, Matti Järvisalo, and Martin Suda, editors. Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions. Department of Computer Science Series of Publications B. Department of Computer Science, University of Helsinki, Finland, 2023. Google Scholar
  6. Gabriel Bathie, Jérôme Boillot, Nicolas Bousquet, and Théo Pierron. Pace 2023 - tinywidth solver, May 2023. URL: https://doi.org/10.5281/zenodo.7991737.
  7. Pierre Bergé, Édouard Bonnet, and Hugues Déprés. Deciding twin-width at most 4 is NP-complete. In ICALP, volume 229 of LIPIcs, pages 18:1-18:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  8. Pierre Bergé, Édouard Bonnet, Hugues Déprés, and Rémi Watrigant. Approximating highly inapproximable problems on graphs of bounded twin-width. In STACS, volume 254 of LIPIcs, pages 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  9. Gaétan Berthe, Yoann Coudert–Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, and Mathis Rocton. Doblalex/touiouidth: v1.0, June 2023. URL: https://doi.org/10.5281/zenodo.8027196.
  10. Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width III: max independent set, min dominating set, and coloring. In ICALP, volume 198 of LIPIcs, pages 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  11. Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width I: tractable FO model checking. In FOCS, pages 601-612. IEEE, 2020. Google Scholar
  12. Édouard Bonnet and Florian Sikora. The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration. In IPEC, volume 115 of LIPIcs, pages 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  13. Holger Dell, Anselm Haak, Frank Kammer, Alexander Leonhardt, Johannes Meintrup, Meyer Ulrich, and Manuel Penschuck. GUTHM and GUTHMi: Exact and heurstic twin-width solvers, June 2023. URL: https://doi.org/10.5281/zenodo.7996074.
  14. Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond. The first parameterized algorithms and computational experiments challenge. In IPEC, volume 63 of LIPIcs, pages 30:1-30:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  15. Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller. The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration. In IPEC, volume 89 of LIPIcs, pages 30:1-30:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  16. David Dursteler and Yosuke Mizutani. Pace 2023 - exact, June 2023. URL: https://doi.org/10.5281/zenodo.7996823.
  17. M. Ayaz Dzulfikar, Johannes Klaus Fichte, and Markus Hecher. The PACE 2019 parameterized algorithms and computational experiments challenge: The fourth iteration (invited paper). In IPEC, volume 148 of LIPIcs, pages 25:1-25:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. Google Scholar
  18. Ernestine Großmann, Tobias Heuer, Christian Schulz, and Darren Strash. The PACE 2022 parameterized algorithms and computational experiments challenge: Directed feedback vertex set. In IPEC, volume 249 of LIPIcs, pages 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  19. Jippe Hoogeveen. Greetwin pace 2023, June 2023. URL: https://doi.org/10.5281/zenodo.8034100.
  20. Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, and Kirill Simonov. Satwin, June 2023. URL: https://doi.org/10.5281/zenodo.8047007.
  21. Leon Kellerhals, Tomohiro Koana, André Nichterlein, and Philipp Zschoche. The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing. In IPEC, volume 214 of LIPIcs, pages 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  22. Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, and Piotr Wygocki. The PACE 2020 parameterized algorithms and computational experiments challenge: Treedepth. In IPEC, volume 180 of LIPIcs, pages 37:1-37:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  23. Kenneth Langedal, Emmanuel Arrighi, Pål Grønås Drange, Farhad Vadiee, Martin Vatshelle, and Petra Wolf. Zygosity pace 2023, September 2023. URL: https://doi.org/10.5281/zenodo.8370343.
  24. Alex Meiburg. Timeroot/twinwidth: Pace 2023, June 2023. URL: https://doi.org/10.5281/zenodo.8045233.
  25. William Bille Meyling. Metatww solver for pace-2023, June 2023. URL: https://doi.org/10.5281/zenodo.8045541.
  26. Möller, Funk, Jakob, and Großmann. Heitwin-exact - pace challenge 2023, May 2023. URL: https://doi.org/10.5281/zenodo.7988134.
  27. Thomas Möller, Nikita-Nick Funk, Dennis Jakob, and Ernestine Großmann. Heitwin-heuristic - pace challenge 2023, May 2023. URL: https://doi.org/10.5281/zenodo.7986572.
  28. Networks project, 2017. URL: https://www.thenetworkcenter.nl.
  29. André Schidler and Stefan Szeider. A SAT approach to twin-width. In ALENEX, pages 67-77. SIAM, 2022. Google Scholar
  30. Andre Schidler and Stefan Szeider. Computing twin-width with branch & bound - PACE Submission, June 2023. URL: https://doi.org/10.5281/zenodo.8033459.
  31. Lucian Trepteanu. luciantrepteanu/pace2023: pace-2023, May 2023. URL: https://doi.org/10.5281/zenodo.7991297.
  32. Kaio Vieira, alanctprado, emanuel juliano morais silva, and Laila Melo Vaz Lopes. emanueljuliano/pace2023: pace-2023, June 2023. URL: https://doi.org/10.5281/zenodo.8045380.
  33. Christopher Weyand and Marcus Wilhelm. soap1, May 2023. URL: https://doi.org/10.5281/zenodo.7989779.
  34. Bonnet Édouard and Duron Julien. Redalert, June 2023. URL: https://doi.org/10.5281/zenodo.8079499.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact