Approximation Algorithms for Treewidth, Pathwidth, and Treedepth—A Short Survey
| Title: | Approximation Algorithms for Treewidth, Pathwidth, and Treedepth—A Short Survey |
|---|---|
| Authors: | Bodlaender, Hans L.; Sub Algorithms and Complexity; Kráľ, Daniel; Milanič, Martin |
| Publication Year: | 2025 |
| Subject Terms: | Approximation; Graph Algorithms; Pathwidth; Treedepth; Treewidth; Taverne; Theoretical Computer Science; General Computer Science |
| Description: | This short survey discusses old and new approximation algorithms for treewidth, and for the related parameters pathwidth and treedepth. |
| Document Type: | book part |
| File Description: | application/pdf |
| Language: | English |
| ISSN: | 0302-9743 |
| Relation: | https://dspace.library.uu.nl/handle/1874/482731 |
| Availability: | https://dspace.library.uu.nl/handle/1874/482731 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Accession Number: | edsbas.FA559AF8 |
| Database: | BASE |