Abstract
In real-life applications, the provably good layout algorithm presented in Chapter 5 does not perform well enough to be of service. Thus, in practice, the layout problem is solved in a sequence of phases that attack subproblems with exact algorithms or heuristically. These phases are combined with a suitable usage of the circuit hierarchy. The first layout phase usually solves some variant of the placement problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 John Wiley & Sons Ltd
About this chapter
Cite this chapter
Lengauer, T. (1990). Placement, Assignment, and Floorplanning. In: Combinatorial Algorithms for Integrated Circuit Layout. Applicable Theory in Computer Science. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-92106-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-322-92106-2_7
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-322-92108-6
Online ISBN: 978-3-322-92106-2
eBook Packages: Springer Book Archive