Max Independent Set on twin-width-4 graphs admits no polynomial-time n to the power gamma over (log log n) squared approximation unless ETH fails.
5 Andrej Bogdanov, Kenji Obata, and Luca Trevisan
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width
Max Independent Set on twin-width-4 graphs admits no polynomial-time n to the power gamma over (log log n) squared approximation unless ETH fails.