Parameterized and Approximation Algorithms for the Load Coloring Problem

F. Barbero, G. Gutin, M. Jones +1

Let $c,k$ be two positive integers and let $G=(V,E)$ be a graph. The $(c,k)$-Load Coloring Problem (denoted $(c,k)$-LCP) asks whether there is a $c$-coloring $φ: V \rightarrow [c]…