2000 character limit reached
Clique in 3-track interval graphs is APX-hard
Published 10 Apr 2012 in cs.CC and cs.DM | (1204.2202v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.