Approximation and Hardness Results for the Maximum Edge q-coloring Problem
We consider the problem of coloring edges of a graph subject to the following constraint: for every vertex v, all the edges incident to v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraint and using the maximum number of colors.
This problem has been studied in the past from the combinatorial and algorithmic point of view. The optimal coloring is known for some special classes of graphs. There is also an approximation algorithm for general graphs, which in the case q = 2 gives a 2-approximation. However, the complexity of finding the optimal coloring was not known.
We prove that for any integer q ≥ 2 the problem is NP-Hard and APX-Hard. We also present a 5/3-approximation algorithm for q = 2 for graphs with a perfect matching.
Unable to display preview. Download preview PDF.
- 1.Erdős, P., Simonovits, M., Sós, V.T.: Anti-ramsey theorems. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. II, vol. 10, pp. 633–643. Colloq. Math. Soc. János Bolyai (1975)Google Scholar
- 2.Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182–189 (2008)Google Scholar
- 5.Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of ramsey theory: A survey. Graphs and Combinatorics (2010)Google Scholar
- 9.Raniwala, A., Chiueh, T.-c.: Architecture and algorithms for an ieee 802.11-based multi-channel wireless mesh network. In: INFOCOM, pp. 2223–2234. IEEE, Los Alamitos (2005)Google Scholar
- 11.Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2004)Google Scholar