Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6592913 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithm | |||
| Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparsest cut | |||
| Property / zbMATH Keywords: sparsest cut / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph partitioning | |||
| Property / zbMATH Keywords: graph partitioning / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
linear programming | |||
| Property / zbMATH Keywords: linear programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
clustering | |||
| Property / zbMATH Keywords: clustering / rank | |||
Normal rank | |||
Revision as of 21:46, 27 June 2023
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
