An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57851363, #quickstatements; #temporary_batch_1712111774907
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A risk-reward framework for the competitive analysis of financial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new measure for the study of on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Canadian Traveller Problem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the \(k\)-Canadian traveller problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Canadian Traveller Problem and its competitive analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-Canadian Travelers Problem with Communication / rank
 
Normal rank

Revision as of 10:43, 10 July 2024

scientific article
Language Label Description Also known as
English
An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
scientific article

    Statements

    An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (English)
    0 references
    0 references
    0 references
    1 July 2015
    0 references
    competitive analysis
    0 references
    online algorithm
    0 references
    Canadian traveller problem
    0 references

    Identifiers