Clique in 3-track interval graphs is APX-hard
Computational Complexity
2012-04-11 v1 Discrete Mathematics
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.
Cite
@article{arxiv.1204.2202,
title = {Clique in 3-track interval graphs is APX-hard},
author = {Minghui Jiang},
journal= {arXiv preprint arXiv:1204.2202},
year = {2012}
}