Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-98355-4_11
+Normal rank
@@ Property / OpenAlex ID @@
+W2887005261
@@ Property / OpenAlex ID: W2887005261 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
+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 string guessing problem as a method to prove lower bounds on the advice complexity
+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 Knapsack Problem
@@ Property / cites work: On the Advice Complexity of the Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The online knapsack problem: advice and randomization
+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 the \(k\)-server problem
+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 @@
+Online algorithms with advice: the tape model
@@ Property / cites work: Online algorithms with advice: the tape model / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Graph Coloring with Advice and Randomized Adversary
+Normal rank
@@ Property / cites work @@
+The k-Server Problem with Advice in d Dimensions and on the Sphere
+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 @@
+Improved analysis of the online set cover problem with advice
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Online Computation with Advice
@@ Property / cites work: Online Computation with Advice / rank @@
+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 @@
+Disjoint Path Allocation with Sublinear Advice
@@ Property / cites work: Disjoint Path Allocation with Sublinear Advice / rank @@
+Normal rank
@@ Property / cites work @@
+On the advice complexity of the \(k\)-server problem under sparse metrics
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / 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 @@
+Matching theory
@@ Property / cites work: Matching theory / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:6163625