A Column Generation Approach for Graph Coloring

We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branch-and-bound tree. This approach, while requiring the solution of a difficult subproblem as well as needing sophisticated branching rules, solves small to moderate size problems quickly. We have also implemented an exact graph coloring algorithm based on DSATUR for comparison. Implementation details and computational experience are presented.

[1]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[2]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[3]  Edward C. Sewell,et al.  An improved algorithm for exact graph coloring , 1993, Cliques, Coloring, and Satisfiability.

[4]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[5]  John L. Hennessy,et al.  The priority-based coloring approach to register allocation , 1990, TOPL.

[6]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[7]  Shi-Jen Lin,et al.  A Pruning Procedure for Exact Graph Coloring , 1991, INFORMS J. Comput..

[8]  Egon Balas,et al.  Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1992, SIAM J. Comput..

[9]  B. Pittel.  On the probable behaviour of some algorithms for finding the stability number of a graph , 1982, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[11]  Craig A. Morgenstern,et al.  Coloration neighborhood structures for general graph coloring , 1990, SODA '90.

[12]  Egon Balas,et al.  Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1991, SIAM J. Comput..

[13]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[14]  Peter Ransom,et al.  The Unexpected Hanging And Other Mathematical Diversions , 1992, The Mathematical Gazette.

[15]  Michael Larsen,et al.  The fractional chromatic number of mycielski's graphs , 1995, J. Graph Theory.

[16]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[17]  Anuj Mehrotra.  Constrained graph partitioning: decomposition, polyhedral structure and algorithms , 1992 .

[18]  Anne Condon,et al.  Experiments with parallel graph coloring heuristics and applications of graph coloring , 1993, Cliques, Coloring, and Satisfiability.

[19]  J. R. Brown.  Chromatic Scheduling and the Chromatic Number Problem , 1972 .

[20]  John L. Hennessy,et al.  Register allocation by priority-based coloring , 1984, SIGPLAN '84.

[21]  Marek Kubale,et al.  A generalized implicit enumeration algorithm for graph coloring , 1985, CACM.

[22]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[23]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[24]  Egon Balas,et al.  A node covering algorithm , 1977 .

[25]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[26]  A. Gamst,et al.  Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.

[27]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[28]  S. Wallace.  Algorithms and Model Formulations in Mathematical Programming , 1989, NATO ASI Series.

[29]  George L. Nemhauser,et al.  Functional description of MINTO : a mixed integer optimizer , 1991 .

[30]  D. de Werra,et al.  An introduction to timetabling , 1985 .