,
Maël Dumas
,
Julien Duron
Creative Commons Attribution 4.0 International license
For every ε > 0, Max Independent Set admits a polynomial-time n^ε-approximation algorithm on n-vertex graphs of effectively bounded twin-width [Bergé et al., STACS '23]. The approximation factor actually obtained is more precisely n^O(1/log log n). Prior to the current paper, no approximation hardness was known for this problem, and the existence of a polynomial-time approximation scheme (PTAS) was repeatedly raised as an open question. We answer this question in a strong sense: We show that there is a constant γ > 0 such that a polynomial-time n^{γ/(log log n)²}-approximation algorithm for Max Independent Set on graphs of twin-width at most 4 would refute the Exponential-Time Hypothesis (ETH). This lower bound further holds if a 4-sequence is provided as part of the input. We show the same hardness of approximation for Min Coloring, which also has a nearly matching n^O(1/log log n)-approximation algorithm on graphs of effectively bounded twin-width.
We also clarify the parameterized complexity of k-Independent Set on graphs of bounded radius-r merge-width when the range of r is limited. There is a fixed-parameter tractable algorithm for k-Independent Set on graphs given with radius-2^O(k²) merge sequences of bounded width [Dreier and Toruńczyk, STOC '25]. We complement this result by showing that k-Independent Set is W[1]-hard on graphs given with radius-o(k) merge sequences of bounded width. We further show that this result also holds for k-Dominating Set.
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2026.7,
author = {Bonnet, \'{E}douard and Dumas, Ma\"{e}l and Duron, Julien},
title = {{Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.7},
URN = {urn:nbn:de:0030-drops-281805},
doi = {10.4230/LIPIcs.IPEC.2026.7},
annote = {Keywords: Hardness of Approximation, bounded twin-width, Maximum Independent Set, Coloring}
}