NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM (Q3982631)
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: NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM |
scientific article; zbMATH DE number 24586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM |
scientific article; zbMATH DE number 24586 |
Statements
NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM (English)
0 references
26 June 1992
0 references
maximum balanced flow problem
0 references
two-terminal network
0 references
maximum integral balanced flow
0 references
maximum vertex-balanced flow problem
0 references
polynomial-time approximation
0 references
0.9041217
0 references
0 references
0.8862071
0 references
0.8852838
0 references
0.8844478
0 references
0.88399684
0 references
0.8795424
0 references
0.8762791
0 references
0 references
