2026-08-06T00:56:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13340 2024-03-06T10:51:44Z ddc:004 open_access

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth Kowalik, Łukasz Mucha, Marcin Nadara, Wojciech Pilipczuk, Marcin Sorge, Manuel Wygocki, Piotr computing treedepth contest implementation challenge FPT This year’s Parameterized Algorithms and Computational Experiments challenge (PACE 2020) was devoted to the problem of computing the treedepth of a given graph. Altogether 51 participants from 20 teams, 12 countries and 3 continents submitted their implementations to the competition. In this report, we describe the setup of the challenge, the selection of benchmark instances and the ranking of the participating teams. We also briefly discuss the approaches used in the submitted solvers and the differences in their performance on our benchmark dataset. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Łukasz Kowalik and Marcin Mucha and Wojciech Nadara and Marcin Pilipczuk and Manuel Sorge and Piotr Wygocki 2020 Is Part Of LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2020.37 urn:nbn:de:0030-drops-133404 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.37 eng https://creativecommons.org/licenses/by/3.0/legalcode