The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

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

Résumé

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.
Fichier principal
Vignette du fichier
report.pdf (528.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01991645 , version 1 (23-01-2019)

Identifiants

Citer

Edouard Bonnet, Florian Sikora. The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. IPEC 2018, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.IPEC.2018.26⟩. ⟨hal-01991645⟩
97 Consultations
310 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More