License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2018.26
URN: urn:nbn:de:0030-drops-102275
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10227/
Go to the corresponding LIPIcs Volume Portal

Bonnet, Édouard ; Sikora, Florian

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

pdf-format:
LIPIcs-IPEC-2018-26.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{bonnet_et_al:LIPIcs:2019:10227,
  author =	{{\'E}douard Bonnet and Florian Sikora},
  title =	{{The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration}},
  booktitle =	{13th International Symposium on Parameterized and Exact  Computation (IPEC 2018)},
  pages =	{26:1--26:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-084-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{115},
  editor =	{Christophe Paul and Michal Pilipczuk},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10227},
  URN =		{urn:nbn:de:0030-drops-102275},
  doi =		{10.4230/LIPIcs.IPEC.2018.26},
  annote =	{Keywords: Steiner tree problem, contest, implementation challenge, FPT}
}

Keywords: Steiner tree problem, contest, implementation challenge, FPT
Collection: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Issue Date: 2019
Date of publication: 05.02.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI