Bounded-space online bin cover (Q1041340): Difference between revisions

@@ Property / DOI @@
-.1007/s10951-009-0116-x
@@ Property / DOI: 10.1007/s10951-009-0116-x / rank @@
-Normal rank
@@ Property / full work available at URL @@
-https://doi.org/10.1007/s10951-009-0116-x
-Normal rank
@@ Property / OpenAlex ID @@
-W2118750144
@@ Property / OpenAlex ID: W2118750144 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-009-0116-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2118750144
@@ Property / OpenAlex ID: W2118750144 / rank @@
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Markov chains, computer proofs, and average-case analysis of best fit bin packing
+Normal rank
@@ Property / cites work @@
+Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
+Normal rank
@@ Property / cites work @@
+Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints
+Normal rank
@@ Property / cites work @@
+Online algorithms for a dual version of bin packing
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of algorithms for dual bin packing problems
+Normal rank
@@ Property / cites work @@
+On the sum-of-squares algorithm for bin packing
@@ Property / cites work: On the sum-of-squares algorithm for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768348
@@ Property / cites work: Q2768348 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Q4507776
@@ Property / cites work: Q4507776 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10951-009-0116-X
@@ Property / DOI: 10.1007/S10951-009-0116-X / rank @@
+Normal rank