We are happy to announce the second iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. The challenge consists of two separate tracks.
1) Compute a tree-decomposition of minimum width. You have 30 minutes per instance. Win by solving more instances than the other participants.
2) Compute some tree-decomposition. You have 30 minutes per instance. Win by printing solutions of smaller width than the other participants.
Detailed instructions and fresh instance sets: https://pacechallenge.wordpress.com/pace-2017/track-a-treewidth/
Given an undirected graph G, compute a smallest set of edges E such that adding E to G results in a chordal graph. You have 30 minutes per instance. Win by solving more instances than the other participants.
Detailed instructions and an instance set: https://pacechallenge.wordpress.com/pace-2017/track-b-minimum-fill-in/
December 1st, 2016: Announcement of the challenges
March 1st, 2017: Submission of preliminary version for bugfixing and leaderboard
May 1st, 2017: Submission of final version
June 1st, 2017: Announcement of the results
September 4-8, 2017: Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2017) in Vienna
Track A (tree width):
– Holger Dell (Saarland University and Cluster of Excellence (MMCI))
Track B (min fill-in):
– Christian Komusiewicz (chair) (Friedrich-Schiller-University Jena)
– Nimrod Talmon (Weizmann Institute of Science)
– Mathias Weller (Laboratory of Informatics, Robotics, and Microelectronics of Montpellier (LIRMM))
– Holger Dell (Saarland University and Cluster of Excellence, MMCI)
– Bart M. P. Jansen (Eindhoven University of Technology)
– Thore Husfeldt (ITU Copenhagen and Lund University)
– Petteri Kaski (Aalto University)
– Christian Komusiewicz (Friedrich-Schiller-University Jena)
– Frances A. Rosamond (chair) (Frances.Rosamond@uib.no, University of Bergen)