2026-07-22T14:10:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10227 2024-03-06T10:44:18Z ddc:004 open_access

The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration Bonnet, Édouard Sikora, Florian Steiner tree problem contest implementation challenge FPT 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Édouard Bonnet and Florian Sikora 2019 Is Part Of LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2018.26 urn:nbn:de:0030-drops-102275 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.26 eng https://creativecommons.org/licenses/by/3.0/legalcode