Online Square Packing (Q3183464): Difference between revisions

@@ Property / arXiv ID @@
+.4502
@@ Property / arXiv ID: 1010.4502 / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal Packings in Two Dimensions
@@ Property / cites work: Orthogonal Packings in Two Dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Shelf algorithms for on-line strip packing
@@ Property / cites work: Shelf algorithms for on-line strip packing / rank @@
+Normal rank
@@ Property / cites work @@
+An improved lower bound for on-line bin packing algorithms
+Normal rank
@@ Property / cites work @@
+Multidimensional on-line bin packing: Algorithms and worst-case analysis
+Normal rank
@@ Property / cites work @@
+Q5501262
@@ Property / cites work: Q5501262 / rank @@
+Normal rank
@@ Property / cites work @@
+TETRIS IS HARD, EVEN TO APPROXIMATE
@@ Property / cites work: TETRIS IS HARD, EVEN TO APPROXIMATE / rank @@
+Normal rank
@@ Property / cites work @@
+On Two Dimensional Packing
@@ Property / cites work: On Two Dimensional Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rectangles in a strip
@@ Property / cites work: Packing rectangles in a strip / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+New classes of fast lower bounds for bin packing problems
+Normal rank