Thumbnail

The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration

Bonnet, Édouard; Sikora, Florian (2018), The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration, dans Paul, Christophe; Pilipczuk, Michal, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik : Wadern, p. 26:1-26:15. 10.4230/LIPIcs.IPEC.2018.26

Voir/Ouvrir
Type
Communication / Conférence
Date
2018
Titre du colloque
IPEC 2018
Date du colloque
2018-08
Ville du colloque
Helsinki
Pays du colloque
Finland
Titre de l'ouvrage
13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Auteurs de l’ouvrage
Paul, Christophe; Pilipczuk, Michal
Éditeur
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Ville d’édition
Wadern
Isbn
978-3-95977-084-2
Pages
26:1-26:15
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Bonnet, Édouard cc
Laboratoire de l'Informatique du Parallélisme [LIP]
Sikora, Florian cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Résumé (EN)
The Program Committee of the Third Parameterized Algorithms and Computational Experiments challenge (PACE 2018) reports on the third iteration of the PACE challenge. This year, all three tracks were dedicated to solve the Steiner Tree problem, in which, given an edge-weighted graph and a subset of its vertices called terminals, one has to find a minimum-weight subgraph which spans all the terminals. In Track A, the number of terminals was limited. In Track B, a tree-decomposition of the graph was provided in the input, and the treewidth was limited. Finally, Track C welcomed heuristics. Over 80 participants on 40 teams from 16 countries submitted their implementations to the competition.
Mots-clés
Steiner tree problem; contest; implementation challenge; FPT