The PACE 2020 Parameterized Algorithms and Computational Experiments challenge: Treedepth

Łukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki

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

8 Scopus citations

Abstract

This year’s Parameterized Algorithms and Computational Experiments challenge (PACE 2020) was devoted to the problem of computing the treedepth of a given graph. Altogether 51 participants from 20 teams, 12 countries and 3 continents submitted their implementations to the competition. In this report, we describe the setup of the challenge, the selection of benchmark instances and the ranking of the participating teams. We also briefly discuss the approaches used in the submitted solvers and the differences in their performance on our benchmark dataset.

Original languageEnglish
Title of host publication15th International Symposium on Parameterized and Exact Computation, IPEC 2020
EditorsYixin Cao, Marcin Pilipczuk
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771726
DOIs
StatePublished - 1 Dec 2020
Externally publishedYes
Event15th International Symposium on Parameterized and Exact Computation, IPEC 2020 - Virtual, Hong Kong, China
Duration: 14 Dec 202018 Dec 2020

Publication series

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

Conference

Conference15th International Symposium on Parameterized and Exact Computation, IPEC 2020
Country/TerritoryChina
CityVirtual, Hong Kong
Period14/12/2018/12/20

Keywords

  • Computing treedepth
  • Contest
  • FPT
  • Implementation challenge

ASJC Scopus subject areas

  • Software

Fingerprint

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

Cite this