Clique in 3-track interval graphs is APX-hard

Details Clique in 3-track interval graphs is APX-hard Clique in 3-track interval graphs is APX-hard

2012-04-10

arxiv.org/abs/1204.2202v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Clique in 3-track interval graphs is APX-hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clique in 3-track interval graphs is APX-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clique in 3-track interval graphs is APX-hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645598