Bin packing can be solved within 1+epsilon in linear time (Q1164429): Difference between revisions

@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank
@@ Property / cites work @@
+New Algorithms for Bin Packing
@@ Property / cites work: New Algorithms for Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Mathematical Methods of Organizing and Planning Production
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank