An approximation algorithm for the via placement problem

The authors consider the via placement problem that arises in multilayer printed circuit board (MPCB) layout systems. It is shown that this problem can be formulated as an integer linear max-flow problem. Since the integer linear max-flow problem is an NP-complete problem, it is unlikely that one ca...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on computer-aided design of integrated circuits and systems Ročník 8; číslo 3; s. 219 - 228
Hlavní autori: Gonzalez, T.F., Kurki-Gowdara, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.03.1989
Institute of Electrical and Electronics Engineers
Predmet:
Applied sciences
Approximation algorithms
Communication system control
Electronic equipment and fabrication. Passive components, printed wiring boards, connectics
Electronics
Exact sciences and technology
Joining processes
Linear programming
Nonhomogeneous media
Pins
Polynomials
Printed circuits
Routing
Wires
Multilayered printed circuit board
Routing
ISSN:0278-0070
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The authors consider the via placement problem that arises in multilayer printed circuit board (MPCB) layout systems. It is shown that this problem can be formulated as an integer linear max-flow problem. Since the integer linear max-flow problem is an NP-complete problem, it is unlikely that one can find an efficient algorithm for its solution. However, a solution to this via placement problem can be obtained by relaxing the integer constraints in the integer linear max-flow problem. A solution to the relaxed linear max-flow problem can be obtained by solving a linear programming problem. The procedure generates in time bounded by a low order polynomial a placement with no more than 2*d/sub OPT/ density, where D/sub OPT/ is the density in an optimal placement.< >
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0278-0070
DOI:10.1109/43.21841