A Single-Exponential Time 2-Approximation Algorithm for Treewidth

We give an algorithm, that given an n-vertex graph G and an integer k, in time 2 O(k) n either outputs a tree decomposition of G of width at most 2k + 1 or determines that the treewidth of G is larger than k. This is the first 2-approximation algorithm for treewidth that is faster than the known exa...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 184 - 192
Main Author:	Korhonen, Tuukka
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.02.2022
Subjects:	Approximation algorithms Computer science Dynamic programming FPT-approximation Heuristic algorithms Time complexity treewidth Upper bound
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!