| Title: |
On the parameterized complexity of computing tree-partitions |
| Authors: |
Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo; Sub Algorithms and Complexity |
| Publication Year: |
2025 |
| Subject Terms: |
approximation algorithms; domino treewidth; parameterized algorithms; parameterized complexity; tree-cut width; tree-partition-width; tree-partitions; treewidth; Theoretical Computer Science; General Computer Science; Discrete Mathematics and Combinatorics |
| Description: |
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand, we can obtain approximations of the tree-partition-width efficiently: we show that there is an algorithm that, given an n-vertex graph G and an integer k, constructs a tree-partition of width O(k7) for G or reports that G has tree-partition-width more than k, in time kO(1)n2. We can improve slightly on the approximation factor by sacrificing the dependence on k, or on n. On the other hand, we show the problem of computing tree-partition-width exactly is XALP-complete, which implies that it is W[t]-hard for all t. We deduce XALP-completeness of the problem of computing the domino treewidth. Next, we adapt some known results on the parameter tree-partition-width and the topological minor relation, and use them to compare tree-partition-width to tree-cut width. Finally, for the related parameter weighted tree-partition-width, we give a similar approximation algorithm (with ratio now O(k15)) and show XALP-completeness for the special case where vertices and edges have weight 1. |
| Document Type: |
article in journal/newspaper |
| File Description: |
application/pdf |
| Language: |
English |
| ISSN: |
1462-7264 |
| Relation: |
https://dspace.library.uu.nl/handle/1874/475760 |
| Availability: |
https://dspace.library.uu.nl/handle/1874/475760 |
| Rights: |
info:eu-repo/semantics/OpenAccess |
| Accession Number: |
edsbas.EFA2F143 |
| Database: |
BASE |