Goals
Papers
Competition
Photos
Organizers
File formats
Download
Workshop
Mailing list
Links
9th DIMACS Implementation Challenge - Shortest Paths

Competition

To make the Challenge more fun, we will have a competition of the point-to-point algorithms on a road graph. We hope that most of the P2P paper contributors will be able to participate, and others will become fans of the competition. (Due to a conflict of interest, the algorithm of Goldberg, Kaplan, Werneck will not be eligible for the competition, but we will run it and provide the results as a proof that the problem is feasible.)

The competition will work in the following way.

Announcement (Nov 13, 2006):
The graph used in the competition is the full strongly connected USA graph with unit arc lengths [download .gr.gz file, 225 MB]
More instructions for people participating in the competition are now available at the URL: http://www.dis.uniroma1.it/~challenge9/temp.


Page maintained by Camil Demetrescu - last updated on Nov 13, 2006