Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs

  • Authors:

  • Douglas E. Carroll;Adam Meyerson;Brian Tagiku

  • Affiliations:

  • Raytheon Company,;University of California, Los Angeles;University of California, Los Angeles

  • Venue:
  • APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been proven NP-Hard. We provide the first constant approximations: a $\frac{4}{3}$-approximation for interval graphs and a $\frac{3}{2}$-approximation for chordal graphs. We extend our techniques to the problem of minimizing spillage in these graph types.