文章基本信息

标题：The last achievements in Steiner tree approximations
本地全文：下载
作者：A. Zelikovsky
期刊名称：Computer Science Journal of Moldova
印刷版ISSN：1561-4042
出版年度：1993
卷号：1
期号：1
页码：35-44
出版社：Institute of Mathematics and Computer Science
摘要：The Steiner tree problem requires a shortest tree spanning a given point set S contained in a metric space (V,d). We describe a new approach to approximation solutions of this problem and analyze the time complexity of several algorithms.