DIMACS Challenge II May 08, 1993 Update There are a number of new files available for ftp from dimacs.rutgers.edu that are listed below. I am in the process of deciding on some instances to be benchmark instance for the Challenge problems. If you have some favorite instances, now is a good time to tell me about them, or to send them to me. Note that the benchmark instances will provide only a small part of the instances solved by any researcher: it is expected that researchers will choose their own experimental design in order to bring out what they feel are important aspects of their algorithms. The benchmarks simply give some common field for inter--algorithm comparisons. Reminder: May 30 deadline for Progress Reports (optional). --------------------------------------------- New files at dimacs.rutgers.edu in the pub/challenge directory. sat/doc/satformat.tex: New satisfiability format file. graph/doc/ccformat.tex: Minor update to graph format file (parameter lines begin with "x"). graph/contributed/jagota/newgenerators.shar: shar file from Arun Jagota (jagota@cs.buffalo.edu) Giving generators, seeds, and so on for direct comparison with his work on Hopfield networks for solving clique problems. sat/contributed/barth/dp.tar,README.dp: work from Peter Barth (barth@mpi-sb.mpg.de) giving an implementation of Davis Putnam for satisfiability. ------------------------------------------------ Please do not hesitate to contact me if you have any comments or suggestions. Mike Trick Challenge Coordinator/ DIMACS Visitor/ Carnegie Mellon University