A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163)
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: A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem |
scientific article; zbMATH DE number 6520550
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem |
scientific article; zbMATH DE number 6520550 |
Statements
A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (English)
0 references
11 December 2015
0 references
unbalanced cut
0 references
Min \(s\)-\(t\) Cut
0 references
approximation algorithm
0 references
linear programming
0 references
network community
0 references
0 references
