Logarithmic hardness of the directed congestion minimization problem (Q2931414)
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 6373924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logarithmic hardness of the directed congestion minimization problem |
scientific article; zbMATH DE number 6373924 |
Statements
Logarithmic hardness of the directed congestion minimization problem (English)
0 references
25 November 2014
0 references
congestion minimization
0 references
directed graphs
0 references
hardness of approximation
0 references
0.9468854665756226
0 references
0.9130793809890748
0 references
0.9116726517677308
0 references
0.8306058645248413
0 references
0.8228281140327454
0 references
