| 约束Steiner最小树问题 |
| |
| 引用本文： | 陈光亭,何勇,姚恩瑜.约束Steiner最小树问题[J].浙江大学学报(理学版),1999,26(4):54-59. |
| |
| 作者姓名： | 陈光亭 何勇 姚恩瑜 |
| |
| 作者单位： | 陈光亭 杭州电子工学院文理分院，浙江 杭州 310037 何 勇 姚恩瑜 浙江大学玉泉校区数学系，浙江 杭州 310027 |
| |
| 摘 要： | 本文首先提出一个约束Steiner最小树问题。设欧氏平面上直线L的一侧有n个点， 记点集为N，现要在L上找一点P，使关于N∪{P}的Steiner树长度最小。文章解决了n=2及n=3的情形。
|
| 关 键 词： | 约束Steiner最小树 约束Steiner标准化 |
| 收稿时间： | 1997-03-26 |
Constrained Steiner Minimum Tree Problem |
| |
| CHEN Guang-ting,HE Yong,YAO En-yu.Constrained Steiner Minimum Tree Problem[J].Journal of Zhejiang University(Sciences Edition),1999,26(4):54-59. |
| |
| Authors: | CHEN Guang-ting HE Yong YAO En-yu |
| |
| Institution: | CHEN Guang-ting1,HE Yong2,YAO En-yu2 (1.The School of Science and Arts ,Hangzhou Institute of Electronic Engineering,Hangzhou 310037,China; 2.Department of Mathematics， Zhejiang University, Hangzhou 310027，China) |
| |
| Abstract: | The constrained Steiner minimum tree problem(CSMTP)is presented. Let L be a straight line in a Euclidean plane,and N={A1,A2,…,An} be a set of n points in the same side of L.The problem is to find a point P in L such that the length of Steiner minimum tree about N∪{P} is minimal.In this paper, the cases of n=2 and 3 are solved. |
| |
| Keywords: | constrained Steiner minimum tree constrained Steinerization |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文 |
