Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

07/15/2022
by   Pierre Bergé, et al.
0

For any ε > 0, we give a polynomial-time n^ε-approximation algorithm for Max Independent Set in graphs of bounded twin-width given with an O(1)-sequence. This result is derived from the following time-approximation trade-off: We establish an O(1)^2^q-1-approximation algorithm running in time exp(O_q(n^2^-q)), for every integer q ⩾ 0. Guided by the same framework, we obtain similar approximation algorithms for Min Coloring and Max Induced Matching. In general graphs, all these problems are known to be highly inapproximable: for any ε > 0, a polynomial-time n^1-ε-approximation for any of them would imply that P=NP [Hastad, FOCS '96; Zuckerman, ToC '07; Chalermsook et al., SODA '13]. We generalize the algorithms for Max Independent Set and Max Induced Matching to the independent (induced) packing of any fixed connected graph H. In contrast, we show that such approximation guarantees on graphs of bounded twin-width given with an O(1)-sequence are very unlikely for Min Independent Dominating Set, and somewhat unlikely for Longest Path and Longest Induced Path. Regarding the existence of better approximation algorithms, there is a (very) light evidence that the obtained approximation factor of n^ε for Max Independent Set may be best possible. This is the first in-depth study of the approximability of problems in graphs of bounded twin-width. Prior to this paper, essentially the only such result was a polynomial-time O(1)-approximation algorithm for Min Dominating Set [Bonnet et al., ICALP '21].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2021

Twin-width and polynomial kernels

We study the existence of polynomial kernels, for parameterized problems...
research
09/08/2023

Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs

We consider the question of approximating Max 2-CSP where each variable ...
research
04/17/2020

On Regularity of Max-CSPs and Min-CSPs

We study approximability of regular constraint satisfaction problems, i....
research
06/27/2021

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms

Lokshtanov et al. [STOC 2017] introduced lossy kernelization as a mathem...
research
02/22/2019

ℓ_1-sparsity Approximation Bounds for Packing Integer Programs

We consider approximation algorithms for packing integer programs (PIPs)...
research
12/14/2017

Approximation Algorithms for Replenishment Problems with Fixed Turnover Times

We introduce and study a class of optimization problems we coin replenis...
research
07/28/2020

Twin-width III: Max Independent Set and Coloring

We recently introduced the graph invariant twin-width, and showed that f...

Please sign up or login with your details

Forgot password? Click here to reset