Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:56, 5 March 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