All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs (Q4577772)
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: All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs |
scientific article; zbMATH DE number 6913596
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs |
scientific article; zbMATH DE number 6913596 |
Statements
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (English)
0 references
3 August 2018
0 references
all-or-nothing multicommodity flow
0 references
edge-disjoint paths
0 references
approximation algorithm
0 references
0 references
0.8624560832977295
0 references
0.8494390845298767
0 references
0.8494389653205872
0 references
0.8431509137153625
0 references
0.825160801410675
0 references
