@inproceedings{a585acf4f8ed4779a97c44871d00ad24,
title = "Area of optimization for higher order hierarchical floorplans",
abstract = "The floorplan area optimization problem is to determine the dimensions of each module when the topology of the floorplan is given. The objective is to minimize the area of the resulting floorplan. We present in this paper an algorithm for general hierarchical floorplans. The shape curves for non-slicing configurations are constructed by operations on the graph representations of the floorplan. The points of a shape curve are determined by simultaneously reducing the length of all longest paths of the vertical adjacency graph, using a minimum cut technique. The algorithm is applicable to hierarchical floorplan of high order, and to modules with infinite set of possible dimensions.",
author = "The, {Khe Sing} and Wong, {D. F.}",
year = "1991",
language = "English (US)",
isbn = "0818622709",
series = "IEEE International Conference on Computer Design - VLSI in Computers and Processors",
publisher = "Publ by IEEE",
pages = "520--523",
booktitle = "IEEE International Conference on Computer Design - VLSI in Computers and Processors",
note = "Proceedings of the 1991 IEEE International Conference on Computer Design - VLSI in Computers and Processors - ICCD '91 ; Conference date: 14-10-1991 Through 16-10-1991",
}