Abstract
The present paper deals with the following problem, which arises in a variety of applications: given a node-weighted rectangular grid graph, perform p horizontal full cuts and q vertical ones so as to make the weights of the resulting ( p+1)( q+1) rectangular subgrids “as close as possible”. Computational complexity aspects are discussed. Several heuristic algorithms for obtaining partitions which minimize the maximum weight of a subgrid are developed, and computational results are reported. Theoretical bounds on the approximation error are also given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
