This is the second call for participation for PACE 2021, the 
Parameterized Algorithms and Computational Experiments Challenge. By 
now, public instances are available and preliminary submissions are 
possible at https://www.optil.io/optilion/. The goals of PACE as well as 
official reports for past challenges can be found on our website: 
https://pacechallenge.org/about/
In this sixth edition, the challenge is on Cluster Editing:
* Input: An undirected graph
* Output: A cluster editing set of minimum cardinality. Here, a cluster 
editing set is a set of edge modifications (addition or deletion) that 
transforms the graph into a cluster graph (each connected component is a 
clique)
** Tracks
------------------------------------------------------------
There are three different tracks in which you can compete:
*Exact:* Compute a cluster editing set of minimum cardinality. You have 
30 minutes per instance. Contestants are ranked by number of instances 
solved and time required.
*Heuristic:* Compute some cluster editing set of decent cardinality. You 
have 10 minutes per instance. Contestants are ranked by quality of results.
*Kernelization:* Compute an equivalent smaller instance. You have 5 
minutes per instance. Contestants are ranked by size of the returned 
instance.
Detailed instructions, ranking methods, and public instances are 
available on: https://pacechallenge.org/2021/tracks/
** Prizes
------------------------------------------------------------
Thanks to the generous sponsoring of the NETWORKS project 
(http://thenetworkcenter.nl/), 4000 euros in prize money is available 
for the winners of the competition.
** Timeline
------------------------------------------------------------
* October 22nd, 2020: Announcement of the challenge (Problem)
* November 20th, 2020: Announcement of the tracks and additional information
* December 16th, 2020: Public instances are available
* March 30th, 2021: Submission via optil.io is open (for testing and 
unofficial, auxiliary leaderboard)
* June 01st, 2021 (AOE): Submission of the final version (solver 
description due two weeks after the source code)
* July 2021: Announcement of the results
* September 6-10, 2021: Award ceremony at the International Symposium on 
Parameterized and Exact Computation (IPEC 2021)
** Program Committee
------------------------------------------------------------
* Andre Nichterlein (mailto:andre.nichterlein@tu-berlin.de) (chair) 
(Technische Universitaet Berlin)
* Leon Kellerhals (Technische Universitaet Berlin)
* Tomohiro Koana (Technische Universitaet Berlin)
* Philipp Zschoche (Technische Universitaet Berlin)
** Steering Committee
------------------------------------------------------------
* Edouard Bonnet (LIP, ENS Lyon)
* Holger Dell (Goethe University Frankfurt and IT University of Copenhagen)
* Johannes Fichte (Technische Universitaet Dresden)
* Markus Hecher (Technische Universitaet Wien)
* Bart M. P. Jansen (chair) (Eindhoven University of Technology)
* Petteri Kaski (Aalto University)
* Lukasz Kowalik (University of Warsaw)
* Marcin Pilipczuk (University of Warsaw)
* Manuel Sorge (Technische Universitaet 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
Posts
 
