A polynomial time approximation algorithm for the two-commodity splittable flow problem (Q2392809)
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: A polynomial time approximation algorithm for the two-commodity splittable flow problem |
scientific article; zbMATH DE number 6194428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time approximation algorithm for the two-commodity splittable flow problem |
scientific article; zbMATH DE number 6194428 |
Statements
A polynomial time approximation algorithm for the two-commodity splittable flow problem (English)
0 references
2 August 2013
0 references
splittable flow
0 references
2-commodity flow
0 references
approximation algorithm
0 references
0.8870254755020142
0 references
0.8396380543708801
0 references
0.836409866809845
0 references
0.8332824110984802
0 references
