The Shortcut Problem – Complexity and Approximation (Q3599067)
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 5501981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Shortcut Problem – Complexity and Approximation |
scientific article; zbMATH DE number 5501981 |
Statements
The Shortcut Problem – Complexity and Approximation (English)
0 references
3 February 2009
0 references
0 references
0.9248917698860168
0 references
0.8191673755645752
0 references
0.8028478622436523
0 references
0.7977278828620911
0 references
0.7967798709869385
0 references
