@comment{{This file has been generated by bib2bib 1.97}}

@comment{{Command line: /usr/bin/bib2bib --expand -ob other.bib -oc other-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "other approximate methods"'}}

@incollection{GloParRya96, title = {Coloring by Tabu Branch and Bound}, author = {Fred Glover and Mark Parker and Jennifer Ryan}, pages = {285--307}, crossref = {dimacs96}, keywords = {graph coloring problem, other approximate methods} }

@inproceedings{CarDel99, title = {A Fast and Simple Local Search for Graph Coloring.}, author = {Massimiliano Caramia and Paolo Dell'Olmo}, booktitle = {Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings}, year = {1999}, editor = {Jeffrey Scott Vitter and Christos D. Zaroliagis}, pages = {316--329}, publisher = {Springer Verlag, Berlin, Germany}, series = {Lecture Notes in Computer Science}, volume = {1668}, keywords = {graph coloring problem, other approximate methods} }

@article{CarDel02, title = {Constraint Propagation in Graph Coloring}, author = {Massimiliano Caramia and Paolo Dell'Olmo}, journal = {Journal of Heuristics}, year = {2002}, number = {1}, pages = {83-107}, volume = {8}, bibsource = {DBLP, http://dblp.uni-trier.de}, keywords = {graph coloring problem, other approximate methods} }

@article{DBLP:journals/dam/DukanovicR08, title = {A semidefinite programming-based heuristic for graph coloring}, author = {Igor Dukanovic and Franz Rendl}, journal = {Discrete Applied Mathematics}, year = {2008}, number = {2}, pages = {180-189}, volume = {156}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1016/j.dam.2006.07.014}, keywords = {graph coloring problem, other approximate methods} }

@unpublished{DukRen05, title = {A semidefinite programming based heuristic for graph coloring}, author = {Igor Dukanovic and Franz Rendl}, note = {Working paper available through the Optimization Online repository. Universitaet Klagenfurt, Institut f{\"u}r Mathematik}, month = {April}, year = {2005}, address = {Austria}, keywords = {graph coloring problem, other approximate methods} }

@article{DBLP:journals/dam/Gelder08, title = {Another look at graph coloring via propositional satisfiability}, author = {Allen Van Gelder}, journal = {Discrete Applied Mathematics}, year = {2008}, number = {2}, pages = {230-243}, volume = {156}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1016/j.dam.2006.07.016}, keywords = {graph coloring problem, other approximate methods} }

@article{DBLP:journals/dam/Prestwich08, title = {Generalised graph colouring by a hybrid of local search and constraint programming}, author = {Steven David Prestwich}, journal = {Discrete Applied Mathematics}, year = {2008}, number = {2}, pages = {148-158}, volume = {156}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1016/j.dam.2006.07.011}, keywords = {graph coloring problem, other approximate methods} }

@article{Ravikumar1996, title = {Parallel search-and-learn techniques and graph coloring}, author = {C. P. Ravikumar and R. Aggarwal}, journal = {Knowledge-Based Systems}, year = {1996}, number = {1}, pages = {3 - 13}, volume = {9}, abstract = {The paper describes a parallel algorithm for graph coloring. The algorithm is ba sed on a search-and-learn technique for combinatorial oprimization, where multip le heuristics are used to search nearly disjoint subspaces of the combinatorial search space, and the resulting solutions are analyzed for good decisions. A dec ision takes the form [`]color nodes i and j using the same color'. If a majority of the heuristics concur on coloring two nodes with the same color, the two nod es are merged into a supernode. Supernodes of more than two nodes can similarly be identified. The given graph can be collapsed into a smaller graph, the node s et of which consists of supernodes. It is shown that an optimal coloring of the collapsed graph can be used to construct an optimal coloring of the original gra ph. Parallelism in the search-and-learn technique is prevalent in the multiple h euristic search phase, and it is easy to exploit using a multiprocessor or a mul ticomputer environment. In the implementation, a network of Sun workstations is used for parallelization. Experimental results are described for a number of lar ge benchmark examples. The results show that the technique can deliver superline ar speedup and superlinear quality for large and difficult examples of node colo ring.}, doi = {10.1016/0950-7051(95)01005-X}, issn = {0950-7051}, keywords = {graph coloring problem, other approximate methods, Parallel search}, url = {http://www.sciencedirect.com/science/article/B6V0P-3VT9PD3-1/2/fa77e6a8af d3efb9e02eaa046123244a} }

@book{dimacs96, title = {Cliques, Coloring, and Satisfiability: Second {DIMACS} Implementation Challenge, 1993}, editor = {David S. Johnson and Michael Trick}, publisher = {American Mathematical Society, Providence, RI, USA}, year = {1996}, series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science}, volume = {26}, keywords = {graph coloring problem, surveys} }