The PACE 2017 Parameterized Algorithms and Computational Experiments challenge: The second iteration

Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

33 Scopus citations

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.

Original languageEnglish
Title of host publication12th International Symposium on Parameterized and Exact Computation, IPEC 2017
EditorsDaniel Lokshtanov, Naomi Nishimura
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770514
DOIs
StatePublished - 1 Feb 2018
Externally publishedYes
Event12th International Symposium on Parameterized and Exact Computation, IPEC 2017 - Vienna, Austria
Duration: 6 Sep 20178 Sep 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume89
ISSN (Print)1868-8969

Conference

Conference12th International Symposium on Parameterized and Exact Computation, IPEC 2017
Country/TerritoryAustria
CityVienna
Period6/09/178/09/17

Keywords

  • Contest
  • FPT
  • Implementation challenge
  • Minimum fill-in
  • Treewidth

Fingerprint

Dive into the research topics of 'The PACE 2017 Parameterized Algorithms and Computational Experiments challenge: The second iteration'. Together they form a unique fingerprint.

Cite this