Skip to main content
Article thumbnail
Location of Repository

A Dynamic-Programming Heuristic for Regular Grid-Graph Partitioning

By Robert Meyer and William Donaldson


Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. These earlier methods differed in the domains of application and the stripe-height selection process, and did not have polynomial run-time guarantees. In this paper, we transform the stripe selection problem for general grid graphs into a shortest path problem. The running time for the entire process of transforming the problem and solving for the shortest path is polynomial with respect to the length of input for the original problem. Computational results are presented that demonstrate improved solution quality for general domains

Year: 2000
OAI identifier:

Suggested articles


  1. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness.
  2. (1989). Digital Image Processing and Computer Vision.
  3. (1996). Distributed Genetic Algorithms for Partitioning Uniform Grids.
  4. (1989). Finite Difference Schemes and Partial Differential Equations.
  5. (2000). Grid-Graph Partitioning.
  6. (1989). Introduction to Algorithms: A Creative Approach.
  7. (1990). Introduction to Algorithms.
  8. (1990). Knapsack Problems: Algorithms and Computer Implementations.
  9. (1997). Locally Optimal Striping for Rectangular Grids.
  10. (1997). Minimum perimeter domain assignment.
  11. (1993). Optimal balanced partitions and a parallel database application.
  12. (1996). Optimal equi-partition of rectangular domains for parallel computation.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.