We are happy to announce the seventh iteration of PACE, the
Parameterized Algorithms and Computational Experiments Challenge. The
goals of PACE as well as official reports for past challenges can be
found on our website: https://pacechallenge.org/.
This year, the challenge is on Directed Feedback Vertex Set:
* Input: A directed graph
* Output: Find a minimum subset X of V such that, when all vertices of X
and their adjacent edges are deleted from G, the remainder is acyclic.
** Tracks
------------------------------------------------------------
We will have one track for Exact algorithms and another for Heuristic
algorithms.
**Exact:**
Your task is to find an optimal solution of each Directed Feedback
Vertex Set instance within the time limit of 30 minutes.
You will be ranked by the number of solved instances.
**Heuristic:**
Your task is to find the best solution of each Directed Feedback Vertex
Set instance within the time limit of 10 minutes.
You will be ranked by the quality of the solution.
** Timeline
------------------------------------------------------------
- September 2021: Announcement of the challenge (Problem) and tracks
- November 2021: Announcement of additional information
and ranking methods
- January 2022: Public instances are available
- March 2022: Submission via [optil.io](https://optil.io/) is open
(for testing and unofficial, auxiliary leaderboard)
- June 1st, 2022 (AoE): Submission deadline for solver
- June 15th, 2022 (AoE): Submission deadline for solver description
- July, 2022: Announcement of the results
- September 2022: Award ceremony at the International Symposium on
Parameterized and Exact Computation (IPEC 2022)
** Program Committee
------------------------------------------------------------
- Christian Schulz (chair) (Universität Heidelberg)
- Ernestine Großmann (Universität Heidelberg)
- Tobias Heuer (Karlsruhe Institute of Technology)
- Darren Strash (Hamilton College)
** Steering Committee
------------------------------------------------------------
* Holger Dell (Goethe University Frankfurt and IT University of Copenhagen)
* Johannes Fichte (Technische Universität Dresden)
* Markus Hecher (Technische Universität Wien)
* Bart M. P. Jansen (chair) (Eindhoven University of Technology)
* Łukasz Kowalik (University of Warsaw)
* André Nichterlein (Technical University of Berlin)
* Marcin Pilipczuk (University of Warsaw)
* Manuel Sorge (Technische Universität Wien)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
