Fractional programming formulation for the vertex coloring problem
Data Structures and Algorithms
2015-01-12 v1
Abstract
We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors will be distinguishable. Although the objective function is fractional, it can be replaced by a piece-wise linear convex function. Numerical experiments show that our formulation has significantly good performance for dense graphs.
Cite
@article{arxiv.1402.5769,
title = {Fractional programming formulation for the vertex coloring problem},
author = {Tomomi Matsui and Noriyoshi Sukegawa and Atsushi Miyauchi},
journal= {arXiv preprint arXiv:1402.5769},
year = {2015}
}
Comments
6 pages, 5 tables