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 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
------------------------------------------------------------
Three tracks are planned:
*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. Detailed ranking method will be published online.
*Heuristic:* Compute some cluster editing set of decent cardinality. You
have 10 minutes per instance. Contestants are ranked by quality of
results and time required. Detailed ranking method will be published online.
*Kernelization:* Compute an equivalent smaller instance. You have 5
minutes per instance. Contestants are ranked by size of the returned
instance. Detailed ranking method will be published online.Detailed
instructions and public instances will be published later (see Timeline
below)
** Prizes
------------------------------------------------------------
Thanks to the generous sponsoring of the NETWORKS project
(http://thenetworkcenter.nl/) 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
* TBA / March 2021: Submission via optil.io is open (for testing and
unofficial, auxiliary leaderboard)
* TBA / May/June 2021 (AOE): Submission of the final version (solver
description due two weeks after the source code)
* TBA / July 2021: Announcement of the results
* TBA / September 6-10, 2021: Award ceremony at the International
Symposium on Parameterized and Exact Computation (IPEC 2021)
** Program Committee
------------------------------------------------------------
* André Nichterlein (mailto:andre.nichterlein@tu-berlin.de) (chair)
(Technische Universität Berlin)
* Leon Kellerhals (Technische Universität Berlin)
* Tomohiro Koana (Technische Universität Berlin)
* Philipp Zschoche (Technische Universität Berlin)
** Steering Committee
------------------------------------------------------------
* Édouard Bonnet (LIP, ENS Lyon)
* 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)
* Petteri Kaski (Aalto University)
* Łukasz Kowalik (University of Warsaw)
* 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
