Local improvement in Steiner trees

Local improvement in Steiner trees

An approach to the construction of rectilinear Steiner spanning trees that takes advantage of an elegant new representation to simply apply local improvement methods to the problem is presented. Use of a special type of Steiner tree allows the results to contain a minimum number of vias while achiev...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lewis, F.D., Pong, W.C.-C., Van Cleave, N.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer science
Educational institutions
Heuristic algorithms
NP-complete problem
Steiner trees
Wire
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An approach to the construction of rectilinear Steiner spanning trees that takes advantage of an elegant new representation to simply apply local improvement methods to the problem is presented. Use of a special type of Steiner tree allows the results to contain a minimum number of vias while achieving a significant reduction in wire length over previous methods.< >
DOI:10.1109/GLSV.1993.224470