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.
22 Johan Håstad
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
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.
-
The price of incrementality in k-center clustering
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.