Complexity and approximability of the maximum flow problem with minimum quantities (Q2811300)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity and approximability of the maximum flow problem with minimum quantities |
scientific article; zbMATH DE number 6591784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability of the maximum flow problem with minimum quantities |
scientific article; zbMATH DE number 6591784 |
Statements
Complexity and approximability of the maximum flow problem with minimum quantities (English)
0 references
10 June 2016
0 references
maximum flow problem
0 references
minimum quantities
0 references
computational complexity
0 references
approximation algorithms
0 references
0.9400726
0 references
0.9189693
0 references
0.91875863
0 references
0.91549385
0 references
0.9149837
0 references
0.9120784
0 references
0.90798634
0 references
0.9078999
0 references
