On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2467644617
@@ Property / OpenAlex ID: W2467644617 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2108
@@ Property / arXiv ID: 1305.2108 / 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 @@
+The 3-server problem in the plane.
@@ Property / cites work: The 3-server problem in the plane. / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized algorithm for two servers in cross polytope spaces
+Normal rank
@@ Property / cites work @@
+Online coloring of bipartite graphs with and without advice
+Normal rank
@@ Property / cites work @@
+On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
+Normal rank
@@ Property / cites work @@
+The online knapsack problem: advice and randomization
+Normal rank
@@ Property / cites work @@
+The string guessing problem as a method to prove lower bounds on the advice complexity
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the k-Server Problem
@@ Property / cites work: On the Advice Complexity of the k-Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of Online Problems
@@ Property / cites work: On the Advice Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+On the list update problem with advice
@@ Property / cites work: On the list update problem with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Q2965482
@@ Property / cites work: Q2965482 / rank @@
+Normal rank
@@ Property / cites work @@
+New Ressults on Server Problems
@@ Property / cites work: New Ressults on Server Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal On-Line Algorithm for <i>K</i> Servers on Trees
+Normal rank
@@ Property / cites work @@
+Random walks on weighted graphs and applications to on-line algorithms
+Normal rank
@@ Property / cites work @@
+Online Graph Exploration with Advice
@@ Property / cites work: Online Graph Exploration with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+How Much Information about the Future Is Needed?
@@ Property / cites work: How Much Information about the Future Is Needed? / rank @@
+Normal rank
@@ Property / cites work @@
+Collective Tree Spanners and Routing in AT-free Related Graphs
+Normal rank
@@ Property / cites work @@
+Collective tree spanners of graphs
@@ Property / cites work: Collective tree spanners of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Navigation and Distance Oracles for Graphs with Small Treewidth
+Normal rank
@@ Property / cites work @@
+Advice Complexity of Online Coloring for Paths
@@ Property / cites work: Advice Complexity of Online Coloring for Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
+Normal rank
@@ Property / cites work @@
+On Advice Complexity of the k-server Problem under Sparse Metrics
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138907
@@ Property / cites work: Q3138907 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive randomized algorithms for nonuniform problems
+Normal rank
@@ Property / cites work @@
+Advice Complexity and Barely Random Algorithms
@@ Property / cites work: Advice Complexity and Barely Random Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the Set Cover Problem
@@ Property / cites work: On the Advice Complexity of the Set Cover 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 @@
+The 2-evader problem
@@ Property / cites work: The 2-evader problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3977465
@@ Property / cites work: Q3977465 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive algorithms for server problems
@@ Property / cites work: Competitive algorithms for server problems / rank @@
+Normal rank
@@ Property / cites work @@
+On embedding trees into uniformly convex Banach spaces
+Normal rank
@@ Property / cites work @@
+On Online Algorithms with Advice for the k-Server Problem
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity of the Online Coloring Problem
@@ Property / cites work: Advice Complexity of the Online Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Compact and low delay routing labeling scheme for unit disk graphs
+Normal rank