A note on the online First-Fit algorithm for coloring k-inductive graphs

  • Authors:

  • Shakhar Smorodinsky

  • Affiliations:

  • Department of Mathematics, Ben-Gurion University, Be'er Sheva 84105, Israel

  • Venue:
  • Information Processing Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.89

Visualization

Abstract

In a FOCS 1990 paper, S. Irani proved that the First-Fit online algorithm for coloring a graph uses at most O(klogn) colors for k-inductive graphs. In this note we provide a very short proof of this fact.