A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximability of partitioning graphs with supply and demand / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning graphs of supply and demand / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic method for solving the problem of partitioning graphs with supply and demand / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning Distribution Trees of Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parametric Network Flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parametric power supply networks / rank | |||
Normal rank | |||
Revision as of 10:58, 21 July 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
