published by Minghui Jiang
in 2012
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.