Key points are not available for this paper at this time.
In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a (2/3) -approximation for the Maximum Independent Set problem on interval graphs. We show that this is tight, even on unit interval graphs of maximum degree 3. We show that on chordal graphs, the greedy algorithm is a (1/2) -approximation and that this is again tight. These results contrast with the known (tight) approximation ratio of 3+2 of the greedy algorithm for general graphs of maximum degree.
Chaplick et al. (Sat,) studied this question.