The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms.
More information and official reports for past challenges can be found on our new website: https://pacechallenge.org/
** Track 1 (Vertex Cover)
------------------------------------------------------------
a) Compute an optimal vertex cover. You have 30 minutes per instance.
Contestants are ranked by number of instances solved and time required.
Detailed instructions: https://pacechallenge.org/2019/vc/
** Track 2 (Hypertree Width)
------------------------------------------------------------
a) Compute an optimal hypertree decomposition (hypertree decomposition of minimum hypertree width). You have 30 minutes per instance.
Contestants are ranked by number of instances solved and time required.
b) Compute some hypertree decomposition of decent hypertree width. You have 30 minutes per instance. Contestants are ranked by quality of results and time required. Exact ranking method will be published online.
Detailed instructions and public instances:
https://pacechallenge.org/2019/htd/
** Prizes
------------------------------------------------------------
Thanks to the generous sponsoring of the NETWORKS project
(https://www.thenetworkcenter.nl/) and data-experts.de, a total of 4750 Euro of prize money and travel support is available for the winners of the competition.
** Timeline
------------------------------------------------------------
* December 10th, 2018: Public Hypertree Width instances online
* January 7th, 2019: Public Vertex Cover instances online
* May 2nd, 2019: Submission of final version
* July 1st, 2019: Announcement of the results
* September 11-13, 2019: Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2019) in Munich
** Program Committee
------------------------------------------------------------
* Johannes Fichte (TU Dresden, Germany)
* Markus Hecher (TU Vienna, Austria)
** Steering Committee
------------------------------------------------------------
* Édouard Bonnet (Middlesex University, London)
* Holger Dell (Saarland Informatics Campus)
* Bart M. P. Jansen (chair) (Eindhoven University of Technology)
* Thore Husfeldt (ITU Copenhagen and Lund University)
* Petteri Kaski (Aalto University)
* Christian Komusiewicz (Philipps-Universität Marburg)
* Frances A. Rosamond (University of Bergen)
* Florian Sikora (LAMSADE, Université Paris Dauphine)
**********************************************************
*
* 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
