A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2019.05.014 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127839294 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2019.05.014 / rank | |||
Normal rank | |||
Latest revision as of 19:51, 17 December 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
0 references
