Before revision:  We first propose a 4-approximation algorithm in O(m^{7k}n\log k) time for this problem , where k is a positive integer  .
After revision:  We first propose a 4-approximation algorithm in O(m^{7k}n\log k) time for this problem , where k is a positive integer k denotes the cardinality of a color-set .