Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2016.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2327131051 / rank | |||
Normal rank | |||
Revision as of 01:53, 20 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
