Interconnecting highways
Du, DZ; Hwang, FK; Xue, GL
刊名SIAM JOURNAL ON DISCRETE MATHEMATICS
1999-04-29
卷号12期号:2页码:252-261
关键词interconnecting networks optimality conditions Steiner trees
ISSN号0895-4801
英文摘要We present the problem of constructing roads of minimum total length to interconnect n highways under the constraint that the roads can intersect each highway only at one point in a designated interval which is a line segment. We present a set of optimality conditions for the problem and show how to construct a solution to meet this set of optimality conditions.
WOS研究方向Mathematics
语种英语
出版者SIAM PUBLICATIONS
WOS记录号WOS:000080071500007
内容类型期刊论文
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/14363]  
专题中国科学院数学与系统科学研究院
通讯作者Du, DZ
作者单位1.Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA
2.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China
3.Natl Chiao Tung Univ, Dept Appl Math, Hsinchu 30050, Taiwan
4.Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA
推荐引用方式
GB/T 7714
Du, DZ,Hwang, FK,Xue, GL. Interconnecting highways[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS,1999,12(2):252-261.
APA Du, DZ,Hwang, FK,&Xue, GL.(1999).Interconnecting highways.SIAM JOURNAL ON DISCRETE MATHEMATICS,12(2),252-261.
MLA Du, DZ,et al."Interconnecting highways".SIAM JOURNAL ON DISCRETE MATHEMATICS 12.2(1999):252-261.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace