ON BETTER HEURISTICS FOR STEINER MINIMUM TREES
文献类型：期刊论文
| 作者 | DU, DZ; ZHANG, YJ |
| 刊名 | MATHEMATICAL PROGRAMMING
 |
| 出版日期 | 1992-11-02 |
| 卷号 | 57期号:2页码:193-202 |
| 关键词 | STEINER TREES APPROXIMATION PERFORMANCE RATIO |
| ISSN号 | 0025-5610 |
| 英文摘要 | Finding a shortest network interconnecting a given set of points in a metric space is called the Steiner minimum tree problem. The Steiner ratio is the largest lower bound for the ratio between lengths of a Steiner minimum tree and a minimum spanning tree for the same set of points. In this paper, we show that in a metric space, if the Steiner ratio is less than one and finding a Steiner minimum tree for a set of size bounded by a fixed number can be performed in polynomial time, then there exists a polynomial-time heuristic for the Steiner minimum tree problem with performance ratio bigger than the Steiner ratio. It follows that in the Euclidean plane, there exists a polynomial-time heuristic for Steiner minimum trees with performance ratio bigger than 1/2 square-root 3. This solves a long-standing open problem. |
| WOS研究方向 | Computer Science ; Operations Research & Management Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:A1992KE27800004 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/27691]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | DU, DZ |
| 作者单位 | 1.CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA 2.SO METHODIST UNIV,DEPT COMP SCI,DALLAS,TX 75275 |
| 推荐引用方式 GB/T 7714 | DU, DZ,ZHANG, YJ. ON BETTER HEURISTICS FOR STEINER MINIMUM TREES[J]. MATHEMATICAL PROGRAMMING,1992,57(2):193-202. |
| APA | DU, DZ,&ZHANG, YJ.(1992).ON BETTER HEURISTICS FOR STEINER MINIMUM TREES.MATHEMATICAL PROGRAMMING,57(2),193-202. |
| MLA | DU, DZ,et al."ON BETTER HEURISTICS FOR STEINER MINIMUM TREES".MATHEMATICAL PROGRAMMING 57.2(1992):193-202. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。