A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5896083)
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 strongly polynomial time algorithm for the maximum supply rate problem on trees |
scientific article; zbMATH DE number 7218088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial time algorithm for the maximum supply rate problem on trees |
scientific article; zbMATH DE number 7218088 |
Statements
A strongly polynomial time algorithm for the maximum supply rate problem on trees (English)
0 references
7 July 2020
0 references
1.0000002
0 references
0.8748187
0 references
0 references
0.86612415
0 references
0.86612415
0 references
0.86075544
0 references
0 references
0.8545796
0 references
0.8545761
0 references
