Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116)
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: Weighted nearest neighbor algorithms for the graph exploration problem on cycles |
scientific article; zbMATH DE number 5778954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted nearest neighbor algorithms for the graph exploration problem on cycles |
scientific article; zbMATH DE number 5778954 |
Statements
Weighted nearest neighbor algorithms for the graph exploration problem on cycles (English)
0 references
2 September 2010
0 references
on-line algorithms
0 references
graph exploration problem
0 references
weighted nearest neighbor
0 references
competitive ratio
0 references
1.0000002
0 references
0.8871836
0 references
0.8848308
0 references
0.88164747
0 references
0.86450243
0 references
0 references
0 references
