A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-019-00493-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2991644895
@@ Property / OpenAlex ID: W2991644895 / rank @@
+Normal rank
@@ Property / cites work @@
+On the competitive ratio of the work function algorithm for the \(k\)-server problem
+Normal rank
@@ Property / cites work @@
+Q4010306
@@ Property / cites work: Q4010306 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-server problem
@@ Property / cites work: The \(k\)-server problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the             <i>k</i>             -server conjecture
@@ Property / cites work: On the <i>k</i> -server conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q3977465
@@ Property / cites work: Q3977465 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
+Normal rank
@@ Property / cites work @@
+A fast work function algorithm for solving the \(k\)-server problem
+Normal rank
@@ Property / Wikidata QID @@
+Q126658342
@@ Property / Wikidata QID: Q126658342 / rank @@
+Normal rank