PACE challenge @PACE_challenge

The Parameterized Algorithms and Computational Experiments Challenge pacechallenge.org Joined September 2018

Tweets

36
Followers

98
Following

21
Likes

7

PACE challenge @PACE_challenge

3 years ago

We now opened the leaderboard for this year's challenge about twinwidth. You can find the exact track at optil.io/optilion/probl… and the heuristic track at optil.io/optilion/probl…. We are looking forward to many exciting submissions to compute twinwidth decompositions!

0 3 6 1K 0

PACE challenge @PACE_challenge

5 years ago

The public instances for the cluster editing problem are now available for download! pacechallenge.org/2020/12/16/pub… #PACE2021

0 2 5 0 1

PACE challenge @PACE_challenge

5 years ago

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. pacechallenge.org/2021/

0 0 1 0 0

PACE challenge @PACE_challenge

5 years ago

#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. pacechallenge.org/2021/

1 0 3 0 0

PACE challenge @PACE_challenge

5 years ago

#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. pacechallenge.org/2021/

0 0 0 0 0

PACE challenge @PACE_challenge

5 years ago

#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. pacechallenge.org/2021/

0 0 0 0 0

PACE challenge @PACE_challenge

5 years ago

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.

0 1 2 0 0

Download Image

PACE challenge @PACE_challenge

5 years ago

#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)

0 0 0 0 0

Download Image

PACE challenge @PACE_challenge

5 years ago

#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": scholar.google.com/scholar?hl=en&…

0 0 1 0 0

PACE challenge @PACE_challenge

5 years ago

#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.

0 1 3 0 0

Download Image

PACE challenge @PACE_challenge

5 years ago

#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. pacechallenge.org/2021/

0 9 17 0 2

Download Image

PACE challenge @PACE_challenge

5 years ago

The results of fifth iteration of the Parameterized Algorithms and Experiments Challenge (PACE 2020) are out: pacechallenge.org/2020/results/ 51 participants, 20 teams, 12 countries, 3 continents