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 the normal view instead:
scientific article; zbMATH DE number 6520550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.979542911052704
0 references
0.8881711363792419
0 references
0.8190113306045532
0 references
0.7947769165039062
0 references
0.781057596206665
0 references
