Online chasing problems for regular polygons (Q975435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex body chasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CNN problem and other \(k\)-server variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized two-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orthogonal CNN problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted 2-server problem / 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: The 3-server problem in the plane. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank

Revision as of 21:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Online chasing problems for regular polygons
scientific article

    Statements

    Online chasing problems for regular polygons (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2010
    0 references
    on-line algorithms
    0 references
    analysis of algorithms
    0 references
    competitive analysis
    0 references
    server location problem
    0 references

    Identifiers