Greedy algorithm is a (2/3)-approximation for Maximum Independent Set on interval graphs and a (1/2)-approximation on chordal graphs.
