Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
The graph bisection problem asks to partition the n vertices of a graph into two sets of equal size so that the number of edges across the cut is minimum. We study finite, connected subgraphs of the infinite two-dimensional grid that do not have holes. Since bisection is an intricate problem, our interest is in the tradeoff between runtime and solution quality that we get by limiting ourselves to a special type of cut, namely cuts with at most one bend each (corner cuts). We prove that optimum corner cuts get us arbitrarily close to equal sized parts, and that this limitation makes us lose only a constant factor in the quality of the solution. We obtain our result by a thorough study of cuts in polygons and the effect of limiting these to corner cuts.
Unable to display preview. Download preview PDF.
- 1.Arbenz, P., Müller, R.: Microstructural finite element analysis of human bone structures. ERCIM News 74, 31–32 (2008)Google Scholar
- 4.Feldmann, A.E., Das, S., Widmayer, P.: Restricted cuts for bisections in solid grids: A proof via polygons. Technical Report 731, Institute of Theoretical Computer Science, ETH Zürich (July 2011)Google Scholar
- 7.MacGregor, R.M.: On partitioning a graph: a theoretical and empirical study. PhD thesis, University of California, Berkeley (1978)Google Scholar
- 9.Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (2008)Google Scholar