The maximum concurrent flow problem (Q3474283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4141512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum concurrent flow problem |
scientific article; zbMATH DE number 4141512 |
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
0.8992063999176025
0 references
0.8961439728736877
0 references
0.8644511699676514
0 references
0.8434922099113464
0 references
