Given a rectangle R with area A and a set of areas L={A1β,...,Anβ}
with βi=1nβAiβ=A, we consider the problem of partitioning R into
n sub-regions R1β,...,Rnβ with areas A1β,...,Anβ in a way that the total
perimeter of all sub-regions is minimized. The goal is to create square-like
sub-regions, which are often more desired. We propose an efficient
1.203--approximation algorithm for this problem based on a divide and conquer
scheme that runs in O(n2) time. For the special case when the
aspect ratios of all rectangles are bounded from above by 3, the approximation
factor is 2/3ββ€1.1548. We also present a modified version of out
algorithm as a heuristic that achieves better average and best run times