The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge. Track A featured the Treewidth problem and Track B the Minimum Fill-In problem. Over 44 participants on 17 teams from 11 countries submitted their implementations to the competition.