The challenge for this year is Cluster Editing:
Input: An undirected graph $G = (V, E)$.
Output: A set of edge modifications (addition or deletion) of minimum size that transforms $G$ into a cluster graph.
You can find more details on Cluster Editing here.
As in PACE 2020, we will have one track for Exact algorithms and another for Heuristic algorithms. In addition, we will have another track for Data Reduction algorithms:
Exact: 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.
Heuristic: 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.
Kernelization: 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.
You can find more details on the ranking methods here.
- October 22nd, 2020: Announcement of the challenge (Problem)
- November 2020: Announcement of the tracks and additional information
- November/December 2020: Public instances are available
- TBA: Submission via optil.io is open (for testing and unofficial, auxiliary leaderboard)
- TBA, 2021: Submission of the final version (solver description due two weeks after the source code)
- TBA, 2021: Announcement of the results
- September 2021: Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2021)