A Note on the Complexity of Stockmeyer's Floorplan Area Optimization

T.-C. Wang; D. F. Wong

doi:10.1142/9789812794468_0010

Back

Journal article

A Note on the Complexity of Stockmeyer's Floorplan Area Optimization

T.-C. Wang and D. F. Wong

World Scientific Algorithmic Aspects of VLSI Layout, pp.309-320

1993

DOI: https://doi.org/10.1142/9789812794468_0010

Abstract

Floorplan design;floorplan area optimization;Stockmeyer's technique;slicing floorplans;hierarchical floorplans

Stockmeyer in Ref. 1 presented an optimal algorithm to solve the floorplan area optimization problem in polynomial time. Although his algorithm was designed only for slicing floorplans, the technique he used can be naturally extended to solve the problem for hierarchiral floorplans.

Metrics

1 Record Views

Details

Title: A Note on the Complexity of Stockmeyer's Floorplan Area Optimization
Creators - without role: T.-C. Wang - The University of Texas at Austin
D. F. Wong
Publication Details: World Scientific Algorithmic Aspects of VLSI Layout, pp.309-320
Identifiers: 978-981-02-1488-3; 9957770682206774
Academic Unit: Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: Traditional Chinese
Resource Type: Journal article

A Note on the Complexity of Stockmeyer's Floorplan Area Optimization

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media