A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:51, 2 February 2024
scientific article; zbMATH DE number 7152262
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial time algorithm for the maximum supply rate problem on trees |
scientific article; zbMATH DE number 7152262 |
Statements
A strongly polynomial time algorithm for the maximum supply rate problem on trees (English)
0 references
16 January 2020
0 references
strongly polynomial-time algorithm
0 references
dynamic programming
0 references
maximum supply rate problem
0 references
