An approximation algorithm for square packing. (Q703277): 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.1016/j.orl.2004.02.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1983390896
@@ Property / OpenAlex ID: W1983390896 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501259
@@ Property / cites work: Q5501259 / rank @@
+Normal rank
@@ Property / cites work @@
+On Packing Two-Dimensional Bins
@@ Property / cites work: On Packing Two-Dimensional Bins / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501258
@@ Property / cites work: Q5501258 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Q4133108
@@ Property / cites work: Q4133108 / rank @@
+Normal rank
@@ Property / cites work @@
+On packing of squares and cubes
@@ Property / cites work: On packing of squares and cubes / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds for multidimensional packing
@@ Property / cites work: New bounds for multidimensional packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Strip-Packing Algorithm with Absolute Performance Bound 2
+Normal rank