Clique in 3-track interval graphs is APX-hard
classification
💻 cs.CC
cs.DM
keywords
cliquegraphsapx-hardintervaltrackbutmanhermelinlewenstein
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.