A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2944949267 / rank | |||
Normal rank | |||
Revision as of 19:18, 19 March 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
