Corner cuts are close to optimal: from solid grids to polygons and back
type: Item
instance of: scholarly article
title: Corner cuts are close to optimal: from solid grids to polygons and back
zbMATH Open document ID: 1262.05125
author: Andreas Emil Feldmann
author: Shantanu Das
author: Peter Widmayer
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6157660
zbMATH Keywords: min-cut
zbMATH Keywords: \(m\)-cut
zbMATH Keywords: bisection
zbMATH Keywords: corner cuts
zbMATH Keywords: grid graphs
zbMATH Keywords: polygons
MaRDI profile type: Publication
full work available at URL: j.dam.2012.12.002
OpenAlex ID: W2083686860
cites work: Optimal Rectangular Partitions
cites work: Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
cites work: An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: The bisection width of grid graphs
cites work: How Good is Recursive Bisection?
cites work: Maximum area with Minkowski measures of perimeter
DOI: 10.1016/J.DAM.2012.12.002
description: scientific article; zbMATH DE number 6157660