Approximation of min coloring by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos - Information Processing Letters, 2009 - Elsevier
We study in this note approximation algorithms for the problem of coloring the vertices of a
graph with as few colors as possible, with moderately exponential running times (and using
either polynomial or exponential space), better than those of exact computation. Study of
approximation is performed with respect to optimality measures, the minimum number of
used colors and the maximum number of unused colors.
graph with as few colors as possible, with moderately exponential running times (and using
either polynomial or exponential space), better than those of exact computation. Study of
approximation is performed with respect to optimality measures, the minimum number of
used colors and the maximum number of unused colors.
以上显示的是最相近的搜索结果。 查看全部搜索结果