Folding a stack of equal width components

Authors:
Venkat Thanvantri;Sartaj Sahni
Affiliations:
Department of CIS, University of Florida, Gainesville, FL;Department of CIS, University of Florida, Gainesville, FL
Venue:
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Year:
1994

Citing 4
Cited 0

Models and algorithms for structured layout

Computer-Aided Design
Place-router for “Sea-of Gates” design style

Progress in computer-aided VLSI design
Optimal algorithms for tree partitioning

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fundamentals of Computer Alori

Fundamentals of Computer Alori

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider two versions of the problem of folding a stack of equal width components. In both versions, when a stack is folded, a routing penalty is incurred at the fold. In one version, the height of the folded layout is given and we are to minimize width. In the other, the width of the folded layout is given and its height is to be minimized.