An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/39573

Title:	An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem
Authors:	Smith, J. M. Lee, D. T. Liebman, J. S.
Issue Date:	1980
Relation:	Engineering Optimization 4, 179-192
URI:	http://ir.sinica.edu.tw/handle/201000000A/39573
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0305-215X&DestApp=JCR&RQ=IF_CAT_BOXPLOT
Appears in Collections:	資訊科學研究所

Show full item record

Last Week
0

Last month
0

checked on Dec 31, 2022

Check