|
A series of activities is underway on Graph Coloring and its generalizations. These activities include a Symposium at CP2002, a workshop at MPS2003, and a refereed volume. The purpose of these activities is to encourage research on computational methods for combinatorial optimization problems, to evaluate alternative approaches using a common testbed, and to stimulate discussion on present and future directions in computational combinatorial optimization.
These activities are on the topic "Graph Coloring and its Generalizations". This topic was chosen due to the wide applicability of graph coloring and the variety of solution approaches that have been proposed. This builds off of a DIMACS Computational Challenge from the fall of 1993, where graph coloring was one of the problems addressed. In addition to the basic graph coloring problem, results are also solicited for the related problems of "multi-coloring" (assigning multiple colors to each node) and bandwidth allocation models (those with minimum difference requirements on the colors on adjacent nodes).
This mailing list is for all those interested in this series of activities.
To see the collection of prior postings to the list,
visit the Color02
Archives.
|
|
Subscribe to Color02 by filling out the following
form.
You will be sent email requesting confirmation, to prevent others from gratuitously subscribing you. This is a private list, which means that the members list is not available to non-members.
|