Almost linear time optimization for single-row floorplanning

Given n cells with their areas and aspect ratio constraints, we present an O(n+d log d) time algorithm to obtain the optimal floorplan of placing these n cells into a single-row, where d is related to the total number of distinct cell classes. Since d is much smaller than n in practical design, our algorithm runs in almost linear time for practical problems.