A greedy algorithm for multicut and integral multiflow in rooted trees (Q1869999)
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 greedy algorithm for multicut and integral multiflow in rooted trees |
scientific article; zbMATH DE number 1903523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm for multicut and integral multiflow in rooted trees |
scientific article; zbMATH DE number 1903523 |
Statements
A greedy algorithm for multicut and integral multiflow in rooted trees (English)
0 references
4 May 2003
0 references
maximum integral multiflow
0 references
minimum multicut
0 references
duality
0 references
rooted tree
0 references
0.9315115809440612
0 references
0.8681352138519287
0 references
0.855512261390686
0 references
0.8054603338241577
0 references
