Sparsest cut on bounded treewidth graphs: algorithms and hardness results (Q5495798)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6326962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparsest cut on bounded treewidth graphs: algorithms and hardness results |
scientific article; zbMATH DE number 6326962 |
Statements
Sparsest cut on bounded treewidth graphs (English)
0 references
7 August 2014
0 references
APX-hardness
0 references
graph separators
0 references
Sherali-Adams
0 references
sparsest cut
0 references
treewidth
0 references
unique games
0 references
0.896416962146759
0 references
0.8700867891311646
0 references
0.8151044845581055
0 references
0.8067665696144104
0 references
0.7786046266555786
0 references
