Titlebook: Combinatorial Algorithms for Integrated Circuit Layout; Thomas Lengauer Textbook 1990 John Wiley & Sons Ltd 1990 Quicksort.algorithms.appr

Spongy-Bone

Kristin Bulkow,Christer PetersenIn this chapter, we will lay the formal framework for discussing the algorithmic problems arising in circuit layout. We will be rather formal right from the beginning, so as to be able to describe clearly the algorithmic structures with which we will be working. The first definition we will give is that of an algorithmic problem.

隐藏

https://doi.org/10.1007/978-3-662-58318-0As we already mentioned in Chapter 1, the layout problem is a constrained optimization problem. There is a multitude of cost functions that is of interest in layout. The most important ones are the following.

范围广

Nebulizer

The Layout ProblemAs we already mentioned in Chapter 1, the layout problem is a constrained optimization problem. There is a multitude of cost functions that is of interest in layout. The most important ones are the following.

Munificent

,Klassische Moderne (1910–1940), 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.

PANEL

Freeze

https://doi.org/10.1007/978-3-531-93264-4 mathematics. We begin with an extensive set of classical definitions from graph theory (Section 3.1). Then we review general algorithmic techniques for exploring graphs so as to impose structures on them (Sections 3.2 to 3.7). Subsequently, we discuss important graph problems that are used in many

娘娘腔

Debate

,Die Moderne im Durchbruch (1870–1910),used directly to divide a circuit into portions that are implemented on separate components, such as printed circuit boards or chips. Here the objective is to partition the circuit into parts such that the sizes of the components are within prescribed ranges and the complexity of connections between

ARY

,Klassische Moderne (1910–1940), 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.