Algorithms and Computational Experiments Challenge (PACE 2016).
Benchmark instances and submission requirements are available at the
challenge website pacechallenge.wordpress.com
<https://pacechallenge.wordpress.com>.
The challenge has two different tracks:
Track A "Tree Width": optimal solutions, heuristics, generating hard
instances, and collecting real-world instances.
Track B "Feedback Vertex Set": fixed-parameter algorithms.
IMPORTANT DATES:
----------------
- 1 March 2016: Call for contributions; benchmark instances available.
- 1 June 2016: Register participation (see pacechallenge.wordpress.com
<https://pacechallenge.wordpress.com> for details).
- 1 August 2016: DEADLINE to submit implementations.
- 22–26 August 2016: Results announced at the International Symposium
on Parameterized and Exact Computation (IPEC 2016
<http://conferences.au.dk/algo16/ipec/>).
GOALS:
------
PACE investigates the applicability of algorithmic ideas studied and
developed in the subfields of multivariate, fine-grained, parameterized,
or fixed-parameter algorithms. It aims to:
- Bridge between algorithms design and analysis theory and algorithm
engineering practice.
- Inspire new theoretical developments.
- Produce universally accessible libraries of implementations and
repositories of benchmark instances.
- Encourage the dissemination of these findings in scientific papers.
Program Committee:
------------------
TRACK A:
- Holger Dell, Saarland University and Simons Institute for the Theory
of Computing
- Thore Husfeldt, Lund University and IT University of Copenhagen
TRACK B:
- Falk Hüffner, TU Berlin
- Christian Komusiewicz, Friedrich Schiller University Jena
PACE Steering Committee:
------------------------
- Holger Dell, Saarland University and Simons Institute for the Theory
of Computing
- Thore Husfeldt, Lund University and IT University of Copenhagen
- Bart M. P. Jansen, Eindhoven University of Technology
- Petteri Kaski, Aalto University
- Christian Komusiewicz, Friedrich Schiller University Jena
- Amer Mouawad, University of Bergen
- Frances Rosamond (chair), University of Bergen
More information can be found on pacechallenge.wordpress.com
<https://pacechallenge.wordpress.com>.
**********************************************************
*
* 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
