Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907): 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/s00453-015-9995-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2001148478
@@ Property / OpenAlex ID: W2001148478 / 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 @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Submodular Secretary Problem and Extensions
@@ Property / cites work: Submodular Secretary Problem and Extensions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708231
@@ Property / cites work: Q2708231 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Primal-Dual Algorithms for Covering and Packing
+Normal rank
@@ Property / cites work @@
+On Multidimensional Packing Problems
@@ Property / cites work: On Multidimensional Packing Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling with interval conflicts
@@ Property / cites work: Online scheduling with interval conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+Online Set Packing
@@ Property / cites work: Online Set Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+The Secretary Problem and Its Extensions: A Review
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
+Normal rank
@@ Property / cites work @@
+Independent sets with domination constraints
@@ Property / cites work: Independent sets with domination constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating \(k\)-set packing
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+A Note on Approximation Schemes for Multidimensional Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Competitive router scheduling with structured data
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Q4234073
@@ Property / cites work: Q4234073 / rank @@
+Normal rank