An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric

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

Title:	An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric
Authors:	Smith, J. M. Lee, D. T. Liebman, J. S.
Issue Date:	1981
Relation:	Networks 11, 23-29
URI:	http://ir.sinica.edu.tw/handle/201000000A/39595
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0028-3045&DestApp=JCR&RQ=IF_CAT_BOXPLOT
Appears in Collections:	資訊科學研究所

Show full item record

checked on Dec 31, 2022

Check