PACE challenge

The Parameterized Algorithms and Computational Experiments Challenge

[PACE challenge @PACE_challenge]

We now opened the leaderboard for this year's challenge about twinwidth. You can find the exact track at https://t.co/4xVxr6Vyy2 and the heuristic track at https://t.co/rTfKHnFtip.
We are looking forward to many exciting submissions to compute twinwidth decompositions!

[PACE challenge @PACE_challenge]

@ac_tuwien PACE 2022 was organized by Christian Schulz (@prof_christian_), Ernestine Großmann (Universität Heidelberg), Tobias Heuer (Karlsruher Institut für Technologie), and Darren Strash (Hamilton College). Thank you all for you work!

[PACE challenge @PACE_challenge]

The slides of the PACE 2022 (Directed Feedback Vertex Set) prize ceremony are available at https://t.co/V5OUjzN5cL

[PACE challenge @PACE_challenge]

@ac_tuwien In the heuristic track of PACE 2022, the solver by Sylwester Swat (Poznań University Of Technology) won. Sylwester won the kernel track in 2021 and the heuristic track in 2020. That's quite a streak, congratulations!

[PACE challenge @PACE_challenge]

The public instances for the cluster editing problem are now available for download!
https://t.co/F6UHI8WWMv
#PACE2021

[PACE challenge @PACE_challenge]

The program committee of #PACE2021 consists of André Nichterlein, Leon Kellerhals (@cofixit), Tomohiro Koana (@tomohirokoana), and Philipp Zschoche. All of them currently work at Technical University of Berlin.

https://t.co/0Xxmq7kwqc

[PACE challenge @PACE_challenge]

#PACE2021 has three tracks. In the KERNELIZATION track, your task is to find an equivalent instance of each Cluster Editing instance within the time limit of 5 minutes. You will be ranked by the size of the returned instance.

https://t.co/0Xxmq7kwqc

[PACE challenge @PACE_challenge]

#PACE2021 has three tracks. In the HEURISTIC track, your task is to find the best solution of each Cluster Editing instance within the time limit of 10 minutes. You will be ranked by the quality of the solution.

https://t.co/0Xxmq7kwqc

[PACE challenge @PACE_challenge]

#PACE2021 has three tracks. In the EXACT track, your task is to find an optimal solution of each Cluster Editing instance within the time limit of 30 minutes. You will be ranked by the number of solved instances.

https://t.co/0Xxmq7kwqc

[PACE challenge @PACE_challenge]

The #PACE2021 problem Cluster Editing can be solved in time 3^k poly(n) using a bounded search tree algorithm: If there is an induced path uvw, we must either add uw, or delete uv, or delete vw.

[PACE challenge @PACE_challenge]

#PACE2021
Cluster Editing is NP-hard. However, it has a simple fixed-parameter tractable (FPT) algorithm when parameterized by the number k of allowed edge modifications.

(image CC-BY-SA-4.0 Fschwarzentruber)

[PACE challenge @PACE_challenge]

#PACE2021
The Cluster Editing problem is one of the most natural ways to model clustering on graphs. Around 1000 publications contain the term "cluster editing": https://t.co/yK1yNDUbBv

[PACE challenge @PACE_challenge]

#PACE2021
Clustering plays an important role in modern society. It is the task of partitioning instances into some number of groups (called clusters) such that instances in the same group are similar to one another.

[PACE challenge @PACE_challenge]

#PACE2021
This year, the Parameterized Algorithms and Computational Experiments problem is Cluster Editing: Find a minimum set of edge modifications (additions and deletions) that transforms the graph into a disjoint union of cliques.

https://t.co/0Xxmq7kwqc

[PACE challenge @PACE_challenge]

The results of fifth iteration of the Parameterized Algorithms and Experiments Challenge (PACE 2020) are out: https://t.co/Ziha1Yxfyd

51 participants, 20 teams, 12 countries, 3 continents

[PACE challenge @PACE_challenge]

The PACE 2020 implementation challenge is proceeding as planned. It's not too late to participate!
See https://t.co/BbeoZYyTru

[PACE challenge @PACE_challenge]

PACE 2020 is about the treedepth problem, and we expect the first preliminary submissions by March 13. https://t.co/BbeoZYyTru