Flexible coloring

Flexible coloring

0.00 Avg rating0 Votes
Article ID: iaor20114443
Volume: 111
Issue: 11
Start Page Number: 538
End Page Number: 540
Publication Date: May 2011
Journal: Information Processing Letters
Authors: , ,
Keywords: colouring, approximation algorithms
Abstract:

? We propose a new optimization problem called ‘flexible coloring’. ? We give a hardness of approximation result for the problem. ? We propose a simple approximation algorithm for the problem.

Reviews

Required fields are marked *. Your email address will not be published.