Approximation and hardness results for the maximum edge q-coloring problem

Anna Adamaszek, Alexandru Popa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings
Pages132-143
Number of pages12
EditionPART 2
DOIs
Publication statusPublished - Dec 1 2010
Event21st Annual International Symposium on Algorithms and Computations, ISAAC 2010 - Jeju Island, Korea, Republic of
Duration: Dec 15 2010Dec 17 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6507 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st Annual International Symposium on Algorithms and Computations, ISAAC 2010
CountryKorea, Republic of
CityJeju Island
Period12/15/1012/17/10

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Adamaszek, A., & Popa, A. (2010). Approximation and hardness results for the maximum edge q-coloring problem. In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings (PART 2 ed., pp. 132-143). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6507 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-17514-5_12