Journal Article10.1145/383251.383257
Efficient list-approximation techniques for floorplan area minimization
2
TL;DR: These new techniques enable us to reduce both the time and space complexities of the previously best known approximation algorithms by more than a factor of n and n2 for rectangular and L-shaped subfloorplans, respectively.
read more
Abstract: As the sizes of many IC design problems become increasingly larger, approximation has become a valuable approach for arriving at satisfactory results without incurring exorbitant computational cost. In this paper, we present several approximation techniques for solving floorplan area minimization problems. These new techniques enable us to reduce both the time and space complexities of the previously best known approximation algorithms by more than a factor of n and n2 for rectangular and L-shaped subfloorplans, respectively (where n is the number of given implementions). The improvements in the time and space complexities of such approximation techniques is critical to their applicability in floorplan area minimization algorithms. The techniques are quite general, and may be applicable to other classes of approximation problems.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Finding an optimal path without growing the tree
TL;DR: This paper presents a general and efficient algorithmic paradigm for finding an actual optimal path for such problems without having to grow a single-source optimal path tree, based on the "marriage-before-conquer" strategy, the prune-and-search technique, and a new data structure called clipped trees.
10
Finding an optimal path without growing the tree
TL;DR: In this article, the authors present a general and efficient algorithm for finding an actual optimal path without having to grow a single-source optimal path tree, based on the "marriage-before-conquer" strategy, the prune-and-search technique, and a new data structure called clipped trees.
References
Automatic Floorplan Design
Ralph H. J. M. Otten
- 01 Jan 1982
TL;DR: The problem of allocating area to modules at the highest level of a top-down decomposition is treated and a theorem of Schoenberg is applied to obtain a good embedding of the module space into the plane.
351
A new area and shape function estimation technique for VLSI layouts
Gerhard Zimmerman
- 01 Jun 1988
TL;DR: A model is presented for the prediction of shape functions for aspect ratios up to 1:5 and can be used for many different design styles and has been tested for standard cell blocks for the placement of general cells.
99
Computing a minimum-weight k-link path in graphs with the concave Monge property
Baruch Schieber
- 22 Jan 1995
TL;DR: An efficient algorithm is given for finding the minimum weightk-link path between a given pair of vertices for any givenk, which can be applied to get efficient solutions for the following problems.
86
Optimal floorplan area optimization
Ting-Chi Wang,D.F. Wong +1 more
TL;DR: Experimental results indicate that the authors' algorithm is efficient and capable of successfully handling large floor plans and running time is substantially less than that of the Wimer algorithm.
69