5-Approximation for H-Treewidth Essentially as Fast as H-Deletion Parameterized by Solution Size

Bart M.P. Jansen, Jari J.H. de Kroon, Michał Włodarczyk

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The notion of H-treewidth, where H is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly speaking, a graph of H-treewidth at most k can be decomposed into (arbitrarily large) H-subgraphs which interact only through vertex sets of size O(k) which can be organized in a tree-like fashion. H-treewidth can be used as a hybrid parameterization to develop fixed-parameter tractable algorithms for H-deletion problems, which ask to find a minimum vertex set whose removal from a given graph G turns it into a member of H. The bottleneck in the current parameterized algorithms lies in the computation of suitable tree H-decompositions. We present FPT-approximation algorithms to compute tree H-decompositions for hereditary and union-closed graph classes H. Given a graph of H-treewidth k, we can compute a 5-approximate tree H-decomposition in time f(O(k)) · nO(1) whenever H-deletion parameterized by solution size can be solved in time f(k)·nO(1) for some function f(k) ≥ 2k. The current-best algorithms either achieve an approximation factor of kO(1) or construct optimal decompositions while suffering from non-uniformity with unknown parameter dependence. Using these decompositions, we obtain algorithms solving Odd Cycle Transversal in time 2O(k) · nO(1) parameterized by bipartite-treewidth and Vertex Planarization in time 2O(k log k) · nO(1) parameterized by planar-treewidth, showing that these can be as fast as the solution-size parameterizations and giving the first ETH-tight algorithms for parameterizations by hybrid width measures.

Original languageEnglish
Title of host publication31st Annual European Symposium on Algorithms, ESA 2023
EditorsInge Li Gortz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772952
DOIs
StatePublished - 1 Sep 2023
Externally publishedYes
Event31st Annual European Symposium on Algorithms, ESA 2023 - Amsterdam, Netherlands
Duration: 4 Sep 20236 Sep 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume274
ISSN (Print)1868-8969

Conference

Conference31st Annual European Symposium on Algorithms, ESA 2023
Country/TerritoryNetherlands
CityAmsterdam
Period4/09/236/09/23

Keywords

  • fixed-parameter tractability
  • graph decompositions
  • treewidth

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of '5-Approximation for H-Treewidth Essentially as Fast as H-Deletion Parameterized by Solution Size'. Together they form a unique fingerprint.

Cite this