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

From MaRDI portal
Created claim: Wikidata QID (P12): Q57851430, #quickstatements; #temporary_batch_1707232231678
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2009.01.024 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148393262 / rank
 
Normal rank
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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ipl/FinkKW09 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2009.01.024 / rank
 
Normal rank

Latest revision as of 11:22, 10 December 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