Integral flow decomposition with minimum longest path length (Q320005)
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 6633760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integral flow decomposition with minimum longest path length |
scientific article; zbMATH DE number 6633760 |
Statements
Integral flow decomposition with minimum longest path length (English)
0 references
6 October 2016
0 references
networks
0 references
flow decomposition
0 references
integral flow
0 references
NP-hard problem
0 references
approximation algorithms
0 references
0.8700284
0 references
0.8605028
0 references
0.85882723
0 references
0.8538848
0 references
0.84228104
0 references
0.84159315
0 references
