A fast work function algorithm for solving the \(k\)-server problem (Q300972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 6 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6599398 / rank
 
Normal rank
Property / zbMATH Keywords
 
online problems
Property / zbMATH Keywords: online problems / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-server problem
Property / zbMATH Keywords: \(k\)-server problem / rank
 
Normal rank
Property / zbMATH Keywords
 
work function algorithm
Property / zbMATH Keywords: work function algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
implementation
Property / zbMATH Keywords: implementation / rank
 
Normal rank
Property / zbMATH Keywords
 
network flows
Property / zbMATH Keywords: network flows / 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.1007/s10100-011-0222-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113692056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two servers on the line. / 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: On the competitive ratio of the work function algorithm for the \(k\)-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970221 / 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: New Ressults on Server Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-evader problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3637924 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 05:42, 12 July 2024

scientific article
Language Label Description Also known as
English
A fast work function algorithm for solving the \(k\)-server problem
scientific article

    Statements

    A fast work function algorithm for solving the \(k\)-server problem (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    online problems
    0 references
    online algorithms
    0 references
    \(k\)-server problem
    0 references
    work function algorithm
    0 references
    implementation
    0 references
    network flows
    0 references

    Identifiers

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