Winners PACE challenge 2017
In 2017, the second edition of the Parameterized Algorithms and Computational Experiments (PACE) challenge was organized, which was sponsored by NETWORKS. Click here to found out who the winners are.
The goal of the Parameterized Algorithms and Computational Experiments Challenge is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. In particular, it aims to:
- Bridge between algorithm design and analysis theory and algorithm engineering practice.
- Inspire new theoretical developments.
- Investigate the competitiveness of analytical and design frameworks developed in the communities.
- Produce universally accessible libraries of implementations and repositories of benchmark instances.
- Encourage dissemination of the findings in scientific papers.
Format of the challenge
The challenge consisted of two tracks. For each track, participation in the challenge essentially meant submitting a program for the respective problem. The best three submissions were awarded with a prize.
Track A: the Tree Width Problem
Track A had a broad scope including the call for algorithms that may solve the problem heuristically and for generators of hard instances.
Track B: Minimum Fill-In
In track B, the goal was to compute optimal chordal completions of a given input graphs.
The award ceremony for the second edition of PACE was held on September 6th 2017 in Vienna, Austria. There was a session dedicated to PACE as part of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), which was part of the
larger ALGO 2017 week of co-located conferences and workshops.
Track A winners, computing treewidth optimally:
- 1st prize: Lukas Larisch and Felix Salfelder (King-Abdullah University of Science and Engineering and University of Leeds).
- 2nd prize: Hiromu Ohtsuka and Hisao Tamaki (Meiji University).
- 3rd prize: Max Bannach, Sebastian Berndt, Thorsten Ehlers (Luebeck University and Kiel University).
Track A winners, computing treewidth heuristically:
- 1st prize: Keitaro Makii, Hiromu Ohtsuka, Takuto Sato, Hisao Tamaki (Meiji University).
- 2nd prize: Ben Strasser (Karlsruhe Institute of Technology).
- 3rd prize: Michael Abseher, Nysret Musliu, Stefan Woltran (TU Wien).
Track B winners, computing minimum fill-in optimally:
- 1st prize: Yasuaki Kobayashi and Hisao Tamaki (Kyoto University and Meiji University).
- 2nd prize: Jeremias Berg, Matti Järvisalo, Tuukka Korhonen (University of Helsinki).
- 3rd prize: Édouard Bonnet, R.B. Sandeep, Florian Sikora (University Paris-Dauphine and Hungarian Academy of Sciences).
Travel award winner:
Keitaro Makii, Hiromu Ohtsuka, Takuto Sato, Hisao Tamaki (Meiji University).
We thank all the participants for their enthusiast participation and look forward to many
interesting iterations of the challenge in the future. You can find more information about PACE on their website.