Article ID Journal Published Year Pages File Type
4951331 Journal of Discrete Algorithms 2016 8 Pages PDF
Abstract
On the algorithmic side, we restrict to the case q=2, since this is the most important in practice and we show a 5/3-approximation algorithm for graphs which have a perfect matching.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Approximation and hardness results for the maximum edge q-coloring problem
Authors
, ,