11th DIMACS Implementation Challenge in Collaboration with ICERM (December 4 - 5, 2014)
The DIMACS Implementation Challenges address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails.
The 11th Implementation Challenge is dedicated to the study of Steiner Tree problems (broadly defined), bringing together research in both theory and practice. Broadly speaking, the goal of a Steiner Tree problem is to find the cheapest way of connecting a set of objects. In most common variants, these objects are either points in a metric space or a subset of the vertices of a network, and the goal is to find a tree that connects all of them.
The main aim of the challenge is to create a reproducible picture of the state-of-the-art in Steiner Tree problems. Phases 1 and 2 of this challenge - the collection and improvement of testbeds and algorithm development and evaluation - began in June 2013. During this workshop, participants will present pre-submitted and vetted papers devoted to Steiner Tree problems. By the end of the workshop, competition results will be announced in anticipation of Phase 3, which will include the final revision of papers for challenge proceedings.