Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2016.03.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2016.03.004 / rank | |||
Normal rank | |||
Latest revision as of 13:38, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems |
scientific article |
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
