Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103): 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.dam.2012.12.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2083686860
@@ Property / OpenAlex ID: W2083686860 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Rectangular Partitions
@@ Property / cites work: Optimal Rectangular Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
+Normal rank
@@ Property / cites work @@
+An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
+Normal rank
@@ Property / cites work @@
+A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+The bisection width of grid graphs
@@ Property / cites work: The bisection width of grid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How Good is Recursive Bisection?
@@ Property / cites work: How Good is Recursive Bisection? / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum area with Minkowski measures of perimeter
@@ Property / cites work: Maximum area with Minkowski measures of perimeter / rank @@
+Normal rank