A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time |
scientific article |
Statements
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (English)
0 references
16 August 2022
0 references
sparsest cut
0 references
linear programming
0 references
approximation algorithms
0 references
0 references
0 references
