Clique in 3-track interval graphs is APX-hard
Minghui Jiang
TL;DR
This paper proves that finding the maximum clique in 3-track interval graphs is APX-hard, indicating it is computationally difficult to approximate within any factor unless P=NP.
Contribution
The paper strengthens previous NP-hardness results to APX-hardness specifically for 3-track interval graphs, highlighting increased computational complexity.
Findings
Clique in 3-track interval graphs is APX-hard.
Approximation within any factor is unlikely unless P=NP.
Extends complexity results from NP-hard to APX-hard.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Formal Methods in Verification