A 2.5 approximation algorithm for the multi-via assignment problem

The via assignment problem, whose objective is to minimize the number of via columns used, is known to be NP-hard even when each net includes at most three vias. The authors develop efficient approximation algorithms for solving this problem. An algorithm for the case in which the size of each net i...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computer-aided design of integrated circuits and systems 1992-11, Vol.11 (11), p.1325-1333
Hauptverfasser:	Bui, T.N., Hsu, W., Lee, S.-L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Approximation algorithms Computer Science Computer Science, Hardware & Architecture Computer Science, Interdisciplinary Applications Electronic equipment and fabrication. Passive components, printed wiring boards, connectics Electronics Engineering Engineering, Electrical & Electronic Exact sciences and technology Integrated circuit interconnections Integrated circuit technology Nonhomogeneous media Optimized production technology Pins Printed circuits Routing Science & Technology Technology Wires
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The via assignment problem, whose objective is to minimize the number of via columns used, is known to be NP-hard even when each net includes at most three vias. The authors develop efficient approximation algorithms for solving this problem. An algorithm for the case in which the size of each net is bounded by three is presented, and is then extended to the case in which the nets have arbitrary sizes.< >
ISSN:	0278-0070 1937-4151
DOI:	10.1109/43.177396