The Ninth DIMACS Implementation Challenge:
The Shortest Path Problem

November 13 - 14, 2006
DIMACS Center, Rutgers University, Piscataway, NJ

Camil Demetrescu, University of Rome "La Sapienza"
Andrew Goldberg, Microsoft Research
David Johnson, AT&T Labs - Research,

Special thanks go to Microsoft Research for its contribution to this meeting.

Call for Participation:

This challenge is open to anyone who wishes to participate. Participants can submit either algorithms or problem instances. Participants may submit results for as many algorithms as they wish.

If you are interested in participating in the Challenge, send email to to let us know of your plans. A good way to be kept in the loop is registering to the Challenge mailing list.

How to participate
Participants should download benchmark instances and code for the problem they address from download page. The page describes the file formats and includes instructions for using the instance generators to create the synthetic instances in the testbed.

Your work can take two different directions.

Previous: Announcement
Next: Program
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on November 28, 2005.