A matched approximation bound for the sum of a greedy coloring

• 27 August 1999
• journal article
• research article
• Published by Elsevier in Information Processing Letters
• Vol. 71  (3-4) , 135-140
• https://doi.org/10.1016/s0020-0190(99)00104-0

Abstract

Keywords

• ANALYSIS OF ALGORITHMS
• GRAPH COLORING
• MAXIMUM INDEPENDENT SET
• SUM COLORING