Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Michele Flammini / rank
Normal rank
 
Property / author
 
Property / author: Michele Flammini / 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.dam.2005.04.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983528447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal On-Line Algorithm for <i>K</i> Servers on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing minimum spanning trees and shortest-path trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>k</i> -server conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving spanning trees by upgrading nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many birds with one stone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:28, 24 June 2024

scientific article
Language Label Description Also known as
English
Competitive algorithms for the bicriteria \(k\)-server problem
scientific article

    Statements

    Competitive algorithms for the bicriteria \(k\)-server problem (English)
    0 references
    0 references
    0 references
    30 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithms
    0 references
    bicriteria optimization
    0 references
    strong competitiveness
    0 references
    0 references