New lower bounds for online \(k\)-server routing problems (Q987824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guessing game and randomized online algorithms / 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: On-line single-server dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: News from the online traveling repairman. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online k-Server Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728857 / rank
 
Normal rank

Revision as of 01:52, 3 July 2024

scientific article
Language Label Description Also known as
English
New lower bounds for online \(k\)-server routing problems
scientific article

    Statements

    New lower bounds for online \(k\)-server routing problems (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    routing
    0 references
    on-line algorithms
    0 references
    competitive analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references