The maximum concurrent flow problem (Q3474283): 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.1145/77600.77620 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035652501 / rank | |||
Normal rank | |||
Revision as of 01:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum concurrent flow problem |
scientific article |
Statements
The maximum concurrent flow problem (English)
0 references
1990
0 references
routing
0 references
graph algorithms
0 references
path and circuit problems
0 references
network partitioning
0 references
primal-dual algorithms
0 references
maximum concurrent flow
0 references
multicommodity flow
0 references
polynomial-time approximation scheme
0 references
