Matched approximation bound for the sum of a greedy coloring

Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz

Research output: Contribution to journalArticlepeer-review


In the minimum sum coloring problem, the goal is to color the vertices of a graph with the positive integers such that the sum of all colors is minimal. Iteratively coloring maximum independent sets has been shown to yield a 4+o(1) approximation for the minimum sum coloring problem. In this note, we show that this bound is tight, by constructing a graph for which the approximation ratio of this coloring is 4-o(1).

Original languageEnglish
Pages (from-to)135-140
Number of pages6
JournalInformation Processing Letters
Issue number3
StatePublished - 27 Aug 1999


Dive into the research topics of 'Matched approximation bound for the sum of a greedy coloring'. Together they form a unique fingerprint.

Cite this