Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116)

From MaRDI portal
Revision as of 04:25, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
scientific article

    Statements

    Weighted nearest neighbor algorithms for the graph exploration problem on cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    0 references
    on-line algorithms
    0 references
    graph exploration problem
    0 references
    weighted nearest neighbor
    0 references
    competitive ratio
    0 references
    0 references