A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time |
scientific article; zbMATH DE number 7898875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time |
scientific article; zbMATH DE number 7898875 |
Statements
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (English)
0 references
20 August 2024
0 references
sparsest cut
0 references
linear programming
0 references
approximation algorithms
0 references
0 references
0.9965969920158386
0 references
0.8700348734855652
0 references
0.8331009745597839
0 references
0.7598450779914856
0 references
