Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5069048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications |
scientific article; zbMATH DE number 5069048 |
Statements
Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (English)
0 references
31 October 2006
0 references
bicriteria version
0 references
new polynomial time algorithms
0 references
0.8867319822311401
0 references
0.8607015013694763
0 references
0.817395806312561
0 references
0.8069212436676025
0 references
