DIMACS

<h2 id="the-dimacs-challenges">The DIMACS Challenges</h2>
<p>DIMACS sponsors implementation challenges to determine practical algorithm performance on problems of interest.  There have been eleven DIMACS challenges so far.
</p>
<ul><li>1990-1991: Network Flows and Matching</li>
<li>1992-1992: <a href="/facts/NP-Hard/mQeNPv4R">NP-Hard</a> Problems: <a href="/facts/Maximum_clique_problem/cVVBNP08">Max Clique</a>, <a href="/facts/Graph_coloring_problem/J6HoBfP0">Graph Coloring</a>, and <a href="/facts/Boolean_satisfiability_problem/wBVRjWoy">SAT</a></li>
<li>1993-1994: Parallel Algorithms for Combinatorial Problems</li>
<li>1994-1995: Computational Biology: Fragment Assembly and Genome Rearrangement</li>
<li>1995-1996: Priority Queues, Dictionaries, and Multidimensional Point Sets</li>
<li>1998-1998: Near Neighbor Searches</li>
<li>2000-2000: Semidefinite and Related Optimization Problems</li>
<li>2001-2001: The <a href="/facts/Traveling_Salesman_Problem/2WEKVLnV">Traveling Salesman Problem</a></li>
<li>2005-2005: The <a href="/facts/Shortest_path/g4nsrswr">Shortest Path Problem</a></li>
<li>2011-2012: <a href="/facts/Graph_partition/MSQF0WyD">Graph Partitioning</a> and <a href="/facts/Community_structure/CKfUKFYh">Graph Clustering</a> <a href="http://www.cc.gatech.edu/dimacs10/">[1]</a></li>
<li>2013-2014: <a href="/facts/Steiner_tree_problem/5mhCq8cN">Steiner Tree Problems</a></li>
<li>2020-2021: <a href="/facts/Vehicle_routing_problem/TS5pWNdR">Vehicle Routing Problems</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="http://dimacs.rutgers.edu/">DIMACS Website</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>A history of mathematics at Rutgers, Charles Weibel. <a href="http://www.math.rutgers.edu/docs/history.html" target="_blank">http://www.math.rutgers.edu/docs/history.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
</ol>

DIMACS open-in-new

DIMACS