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.2017.30
URN: urn:nbn:de:0030-drops-85582
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8558/
Dell, Holger ; Komusiewicz, Christian ; Talmon, Nimrod ; Weller, Mathias
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
| pdf-format: |
|
Abstract
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge. Track A featured the Treewidth problem and Track B the Minimum Fill-In problem. Over 44 participants on 17 teams from 11 countries submitted their implementations to the competition.
BibTeX - Entry
@InProceedings{dell_et_al:LIPIcs:2018:8558,
author = {Holger Dell and Christian Komusiewicz and Nimrod Talmon and Mathias Weller},
title = {{The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration}},
booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)},
pages = {30:1--30:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-051-4},
ISSN = {1868-8969},
year = {2018},
volume = {89},
editor = {Daniel Lokshtanov and Naomi Nishimura},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8558},
URN = {urn:nbn:de:0030-drops-85582},
doi = {10.4230/LIPIcs.IPEC.2017.30},
annote = {Keywords: treewidth, minimum fill-in, contest, implementation challenge, FPT}
}
| Keywords: | treewidth, minimum fill-in, contest, implementation challenge, FPT | |
| Seminar: | 12th International Symposium on Parameterized and Exact Computation (IPEC 2017) | |
| Issue date: | 2018 | |
| Date of publication: | 02.03.2018 |
