Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons (Q3452765): Difference between revisions

@@ Property / author @@
-Mark T. de Berg
@@ Property / author: Mark T. de Berg / rank @@
-Normal rank
@@ Property / author @@
+Mark T. de Berg
@@ Property / author: Mark T. de Berg / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1930762694
@@ Property / OpenAlex ID: W1930762694 / rank @@
+Normal rank
@@ Property / cites work @@
+Bundling Three Convex Polygons to Minimize Area or Perimeter
+Normal rank
@@ Property / cites work @@
+Aligning two convex figures to minimize area or perimeter
+Normal rank
@@ Property / cites work @@
+Q4547792
@@ Property / cites work: Q4547792 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+A \((5/3+\varepsilon)\)-approximation for strip packing
+Normal rank
@@ Property / cites work @@
+Finding the upper envelope of n line segments in O(n log n) time
+Normal rank
@@ Property / cites work @@
+Q4228460
@@ Property / cites work: Q4228460 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple translational containment. II: Exact algorithms
+Normal rank
@@ Property / cites work @@
+Cutting and packing optimization. Problems modeling and solution methods.
+Normal rank
@@ Property / cites work @@
+A Strip-Packing Algorithm with Absolute Performance Bound 2
+Normal rank
@@ Property / cites work @@
+MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
+Normal rank