A \(k\)-server problem with parallel requests and unit distances (Q2446066): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2013.12.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092501142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The harmonic <i>k</i> -server algorithm is competitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special stochastic decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>k</i> -server conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:36, 8 July 2024

scientific article
Language Label Description Also known as
English
A \(k\)-server problem with parallel requests and unit distances
scientific article

    Statements

    A \(k\)-server problem with parallel requests and unit distances (English)
    0 references
    0 references
    15 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    analysis of algorithms
    0 references
    competitive analysis
    0 references
    server problems
    0 references
    combinatorial problems
    0 references
    0 references