中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A PROOF OF THE GILBERT-POLLAK CONJECTURE ON THE STEINER RATIO

文献类型:期刊论文

作者DU, DZ; HWANG, FK
刊名ALGORITHMICA
出版日期1992
卷号7期号:2-3页码:121-135
关键词STEINER TREES SPANNING TREES STEINER RATIO CONVEXITY HEXAGONAL TREES
ISSN号0178-4617
英文摘要Let P be a set of n points on the euclidean plane. Let L(s)(P) and L(m)(P) denote the lengths of the Steiner minimum tree and the minimum spanning tree on P, respectively. In 1968, Gilbert and Pollak conjectured that for any P, L(s)(P) greater-than-or-equal-to (square-root 3/2)L(m)(P). We provide a proof for their conjecture in this paper.
WOS研究方向Computer Science ; Mathematics
语种英语
WOS记录号WOS:A1992HA31400002
出版者SPRINGER VERLAG
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/28205]  
专题中国科学院数学与系统科学研究院
通讯作者DU, DZ
作者单位1.CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
2.AT&T BELL LABS,MURRAY HILL,NJ 07974
推荐引用方式
GB/T 7714
DU, DZ,HWANG, FK. A PROOF OF THE GILBERT-POLLAK CONJECTURE ON THE STEINER RATIO[J]. ALGORITHMICA,1992,7(2-3):121-135.
APA DU, DZ,&HWANG, FK.(1992).A PROOF OF THE GILBERT-POLLAK CONJECTURE ON THE STEINER RATIO.ALGORITHMICA,7(2-3),121-135.
MLA DU, DZ,et al."A PROOF OF THE GILBERT-POLLAK CONJECTURE ON THE STEINER RATIO".ALGORITHMICA 7.2-3(1992):121-135.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。