Approximation algorithms and hardness results for shortest path based graph orientations (Q2904480)
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: Approximation algorithms and hardness results for shortest path based graph orientations |
scientific article; zbMATH DE number 6065593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms and hardness results for shortest path based graph orientations |
scientific article; zbMATH DE number 6065593 |
Statements
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations (English)
0 references
14 August 2012
0 references
0.8561651110649109
0 references
0.8439443707466125
0 references
0.838850736618042
0 references
0.8099255561828613
0 references
0.807192862033844
0 references
