Improved analysis of the online set cover problem with advice (Q2402263): 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.1016/j.tcs.2017.05.029
+Normal rank
@@ Property / OpenAlex ID @@
+W2623507859
@@ Property / OpenAlex ID: W2623507859 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms: a survey
@@ Property / cites work: Online algorithms: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+The Online Set Cover Problem
@@ Property / cites work: The Online Set Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted sums of certain dependent random variables
+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 the Knapsack Problem
@@ Property / cites work: On the Advice Complexity of the Knapsack 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 @@
+On the power of randomization in on-line algorithms
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743425
@@ Property / cites work: Q5743425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / 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 @@
+Measuring the problem-relevant information in input
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / 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 @@
+Probability Inequalities for Sums of Bounded Random Variables
+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 @@
+Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Towards polynomial lower bounds for dynamic problems
+Normal rank