There is no asymptotic PTAS for two-dimensional vector packing (Q293152): Difference between revisions

@@ Property / cites work @@
+On-line and off-line approximation algorithms for vector covering problems
+Normal rank
@@ Property / cites work @@
+On Packing Two-Dimensional Bins
@@ Property / cites work: On Packing Two-Dimensional Bins / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+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 @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Multidimensional Bin Packing Algorithms
@@ Property / cites work: Multidimensional Bin Packing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+New Algorithms for Bin Packing
@@ Property / cites work: New Algorithms for Bin Packing / rank @@
+Normal rank