Approximating highly inapproximable problems on graphs of bounded twin-width

DOI10.4230/lipics.stacs.2023.10MaRDI QIDQ6615109

Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant

Publication date: 8 October 2024

zbMATH Keywords

approximation algorithmsbounded twin-width

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Twin-width. III: Max independent set, min dominating set, and coloring

This page was built for publication: Approximating highly inapproximable problems on graphs of bounded twin-width