TY - JOUR

T1 - On approximating the achromatic number

AU - Kortsarz, Guy

AU - Krauthgamer, Robert

N1 - Copyright:
Copyright 2005 Elsevier Science B.V., Amsterdam. All rights reserved.

PY - 2001/5

Y1 - 2001/5

N2 - The achromatic number problem is to legally color the vertices of an input graph with the maximum number of colors, denoted ψ* , so that every two color classes share at least one edge. This problem is known to be NP-hard. For general graphs we give an algorithm that approximates the achromatic number within a ratio of O(n - log log n/ log n). This improves over the previously known approximation ratio of O(n/ √log n), due to Chaudhary and Vishwanathan [Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 558-563]. For graphs of girth at least 5 we give an algorithm with an approximation ratio O(min{n1/3, √ψ*}). This improves over an approximation ratio O(√ψ*) = O(n3/8) for the more restricted case of graphs with girth at least 6, due to Krysta and Loryś [Proceedings of the Seventh Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 1643, Springer-Verlag, Berlin, 1999, pp. 402-413]. We also give the first hardness result for approximating the achromatic number. We show that for every fixed ε > 0 there is no 2 - ε approximation algorithm, unless P = NP.

AB - The achromatic number problem is to legally color the vertices of an input graph with the maximum number of colors, denoted ψ* , so that every two color classes share at least one edge. This problem is known to be NP-hard. For general graphs we give an algorithm that approximates the achromatic number within a ratio of O(n - log log n/ log n). This improves over the previously known approximation ratio of O(n/ √log n), due to Chaudhary and Vishwanathan [Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 558-563]. For graphs of girth at least 5 we give an algorithm with an approximation ratio O(min{n1/3, √ψ*}). This improves over an approximation ratio O(√ψ*) = O(n3/8) for the more restricted case of graphs with girth at least 6, due to Krysta and Loryś [Proceedings of the Seventh Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 1643, Springer-Verlag, Berlin, 1999, pp. 402-413]. We also give the first hardness result for approximating the achromatic number. We show that for every fixed ε > 0 there is no 2 - ε approximation algorithm, unless P = NP.

KW - Achromatic number

KW - Approximation algorithms

KW - Graph coloring

UR - http://www.scopus.com/inward/record.url?scp=1842634410&partnerID=8YFLogxK

U2 - 10.1137/S0895480100379579

DO - 10.1137/S0895480100379579

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:1842634410

SN - 0895-4801

VL - 14

SP - 408

EP - 422

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 3

ER -