Optimal orientations of cells in slicing floorplan designs

DOI10.1016/S0019-9958(83)80038-2zbMath0545.68030MaRDI QIDQ3334981

Larry J. Stockmeyer

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithmNP-completefloorplanoptimum orientation of cells in a VLSI design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of design theory to circuits and networks (94C30) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (18)

Constructing maximal slicings from geometry ⋮ On the approximability of two tree drawing conventions ⋮ Dynamic expression trees ⋮ Floorplan design of VLSI circuits ⋮ An approximation algorithm for dissecting a rectangle into rectangles with specified areas ⋮ A note on parallel algorithms for optimal h-v drawings of binary trees ⋮ Cut equivalence of \(d\)-dimensional guillotine partitions ⋮ Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach ⋮ Complexity and approximability results for slicing floorplan designs. ⋮ Projected model counting: beyond independent support ⋮ Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations ⋮ Subclasses of Baxter Permutations Based on Pattern Avoidance ⋮ Arthur and Merlin as Oracles ⋮ Maximum weight matching and genetic algorithm for fixed-shape facility layout problem ⋮ An optimal algorithm for layered wheel floorplan designs ⋮ Integrated design of the block layout and aisle structure by simulated annealing ⋮ Optimal cutting directions and rectangle orientation algorithm ⋮ On area-efficient drawings of rectangular duals for VLSI floor-plan

This page was built for publication: Optimal orientations of cells in slicing floorplan designs