A new saling algorithm for the maximum mean cut problem (Q1317477)
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 529941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new saling algorithm for the maximum mean cut problem |
scientific article; zbMATH DE number 529941 |
Statements
A new saling algorithm for the maximum mean cut problem (English)
0 references
17 April 1994
0 references
maximum mean
0 references
scaling algorithm
0 references
circulation feasibility
0 references
minimum-cost circulation
0 references
binary search
0 references
0.7997574806213379
0 references
0.7892618775367737
0 references
0.7870364785194397
0 references
0.7840323448181152
0 references
