Competitive Algorithms for Layered Graph Traversal (Q4210157): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal on-line algorithm for metrical task system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traversing Layered Graphs Using the Work Function Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on weighted graphs and applications to on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex body chasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140445 / rank
 
Normal rank

Revision as of 15:10, 28 May 2024

scientific article; zbMATH DE number 1200797
Language Label Description Also known as
English
Competitive Algorithms for Layered Graph Traversal
scientific article; zbMATH DE number 1200797

    Statements

    Competitive Algorithms for Layered Graph Traversal (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 1998
    0 references
    competitive analysis
    0 references
    layered graphs
    0 references
    search strategies
    0 references

    Identifiers