Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639)
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: Approximation algorithms for the weighted t-uniform sparsest cut and some other graph partitioning problems |
scientific article; zbMATH DE number 6592913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems |
scientific article; zbMATH DE number 6592913 |
Statements
Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (English)
0 references
13 June 2016
0 references
approximation algorithm
0 references
sparsest cut
0 references
graph partitioning
0 references
linear programming
0 references
clustering
0 references
0 references
0 references
0 references
0.8180949687957764
0 references
0.7956088781356812
0 references
0.7954297661781311
0 references
0.7914531826972961
0 references
0.7772239446640015
0 references
