[UAI] Computational Symposium on Graph Coloring and Generalizations: Call for Papers

From: Constraint Programming 2002 (cp2002@cs.cornell.edu)
Date: Thu Mar 21 2002 - 09:02:33 PST

  • Next message: ESEJournal@unisannio.it: "[UAI] Empirical Software Engineering: An International Journal - CALL FOR PAPERS"

     
                        Call for Papers

            Computational Symposium on Graph Coloring
                     and Generalizations
                  
                         

                    September 7 - 13, 2002
                         Ithaca, NY, USA

               http://mat.gsia.cmu.edu/COLORING02/

    A Computational Symposium will be held in conjunction with
    the "Eighth International Conference on Principles and
    Practice of Constraint Programming" (CP-2002) at Cornell
    University, Ithaca, NY (http://www.cs.cornell.edu/cp2002).
    While participants are encouraged to also attend CP-2002,
    attending only the Symposium is permitted.

    This is a preliminary call for papers. There is an email
    list on the web page of the Symposium that interested
    participants should subscribe to for further information.

    IMPORTANT DATES

      March 1: Formal Announcement of Symposium
               Solicitation of "Test Instances"
     
      May 15: Final specification of Generalizations
               and Instances
     
      July 1: Extended abstracts due (5-8 page descriptions
               of methods and computational results on
               test instances)

      July 15: Papers selected for presentation at Symposium

      September 7-8: Symposium at CP-2002
      

      October 15: Final version of paper submitted for refereeing

      Spring 2003: Publication of special volume

    TECHNICAL PROGRAMME

       The purpose of this Symposium 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.

       The Symposium will be on the topic "Graph Coloring and
    Generalizations". This topic was chosen due to the wide
    applicability of graph coloring and the variety of solution
    approaches that have been proposed. This symposium 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).

    Possible topics suitable for the Symposium include:

    * Exact algorithms for graph coloring
       - Constraint programming
       - Integer programming
       - Semidefinite programming
       - Nonlinear approaches

    * Heuristic approaches
       - Metaheuristics
       - Incomplete methods

    * Applications and Instances
       - Instance generators
       - Applications and specially structured instances

    * Evaluation of Methods
       - Methods for algorithm comparison
       - Tools for experimental algorithmics

    All papers should have some computational aspect.

    In addition to the Symposium, there will be a refereed volume
    of a selection of papers presented.

     

    ORGANIZATION

    Chairs

     David S. Johnson Anuj Mehrotra
     Room C239 Management Science Department
     AT&T Labs 417K Jenkins Building
     180 Park Avenue University of Miami
     Florham Park, NJ 07932-0971 Coral Gables, FL 33124-8237
     USA USA
     Email: dsj@research.att.com Email: anuj@miami.edu
     Tel: +1 (973)-360-8440 Tel: +1 (305)-284-1973
     Fax: +1 (973)-255-8178 Fax: +1 (305)-284-2321

     Michael Trick
     Graduate School of
     Industrial Administration
     Carnegie Mellon University
     Pittsburgh, PA 15213
     USA
     Email: trick@cmu.edu
     Tel: +1 (412)-268-3697
     Fax: +1 (412)-268-7057



    This archive was generated by hypermail 2b29 : Thu Mar 21 2002 - 09:11:12 PST