Clique in 3-track interval graphs is APX-hard
  Butman, Hermelin, Lewenstein, and Rawitz proved that Clique in t-interval graphs is NP-hard for t >= 3. We strengthen this result to show that Clique in 3-track interval graphs is APX-hard. 
Minghui Jiang
cs.CC cs.DM