The online knapsack problem: advice and randomization (Q2437775): Difference between revisions

@@ Property / OpenAlex ID @@
+W2025034398
@@ Property / OpenAlex ID: W2025034398 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms: a survey
@@ Property / cites work: Online algorithms: a survey / rank @@
+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 @@
+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 @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Resource augmentation for online bounded space bin packing
+Normal rank
@@ Property / cites work @@
+Measuring the problem-relevant information in input
+Normal rank
@@ Property / cites work @@
+Semi-online preemptive scheduling: one algorithm for all variants
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal preemptive semi-online scheduling to minimize makespan on two related machines
+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 @@
+Online removable square packing
@@ Property / cites work: Online removable square packing / rank @@
+Normal rank
@@ Property / cites work @@
+Online removable knapsack with limited cuts
@@ Property / cites work: Online removable knapsack with limited cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
+Normal rank
@@ Property / cites work @@
+Semi on-line scheduling on two identical machines
@@ Property / cites work: Semi on-line scheduling on two identical machines / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmics for hard problems.
@@ Property / cites work: Algorithmics for hard problems. / 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 @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4737165
@@ Property / cites work: Q4737165 / rank @@
+Normal rank
@@ Property / cites work @@
+Online knapsack with resource augmentation
@@ Property / cites work: Online knapsack with resource augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Speed is as powerful as clairvoyance
@@ Property / cites work: Speed is as powerful as clairvoyance / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+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 @@
+Stochastic on-line knapsack problems
@@ Property / cites work: Stochastic on-line knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal time-critical scheduling via resource augmentation
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with decreasing job sizes
@@ Property / cites work: Semi-online scheduling with decreasing job sizes / rank @@
+Normal rank