On the asymmetric representatives formulation for the vertex coloring problem

Authors:
Manoel Campêlo;Victor A. Campos;Ricardo C. Corrêa
Affiliations:
Mestrado e Doutorado em Ciência da Computação, Universidade Federal do Ceará, Campus do Pici, Bloco 910, 60455-760 Fortaleza, CE, Brazil;Mestrado e Doutorado em Ciência da Computação, Universidade Federal do Ceará, Campus do Pici, Bloco 910, 60455-760 Fortaleza, CE, Brazil;Mestrado e Doutorado em Ciência da Computação, Universidade Federal do Ceará, Campus do Pici, Bloco 910, 60455-760 Fortaleza, CE, Brazil
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 2
Cited 7

Cliques, holes and the vertex coloring polytope

Information Processing Letters
An exact algorithm for the maximum clique problem

Operations Research Letters

A Class Representative Model for Pure Parsimony Haplotyping

INFORMS Journal on Computing
Note: Facet-inducing web and antiweb inequalities for the graph coloring polytope

Discrete Applied Mathematics
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

Computers and Operations Research
Improved formulations for the ring spur assignment problem

INOC'11 Proceedings of the 5th international conference on Network optimization
Estimating population size via line graph reconstruction

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Efficient symmetry breaking formulations for the job grouping problem

Computers and Operations Research
A polyhedral approach for the equitable coloring problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

We consider the vertex coloring problem, which can be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each vertex receives at least one label and the endpoints of every edge are assigned different labels. In this work, the 0-1 integer programming formulation based on representative vertices is revisited to remove symmetry. The previous polyhedral study related to the original formulation is adapted and generalized. New versions of facets derived from substructures of G are presented, including cliques, odd holes and anti-holes and wheels. In addition, a new class of facets is derived from independent sets of G. Finally, a comparison with the independent sets formulation is provided.