版权说明 操作指南
首页 > 成果 > 详情

Shortest path problem with k-intermediate vertex constraints

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Liu, Chun;Zhou, Kang*
通讯作者:
Zhou, Kang
作者机构:
[Zhou, Kang; Liu, Chun] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
通讯机构:
[Zhou, Kang] W
Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
语种:
英文
期刊:
Communications in Computer and Information Science
ISSN:
1865-0929
年:
2014
卷:
472
页码:
664-668
会议名称:
9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)
会议论文集名称:
Communications in Computer and Information Science
会议时间:
OCT 16-19, 2014
会议地点:
Wuhan, PEOPLES R CHINA
会议主办单位:
[Liu, Chun;Zhou, Kang] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议赞助商:
Natl Nat Sci Fdn China, Huazhong Univ Sci &Technol, Zhengzhou Univ Light Ind
主编:
Pan, L Paun, G PerezJimenez, MJ Song, T
出版地:
HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者:
SPRINGER-VERLAG BERLIN
ISBN:
978-3-662-45048-2
机构署名:
本校为第一且通讯机构
院系归属:
数学与计算机学院
摘要:
In urban transit network inquiry system, the optimal scheme of bus line having excessive transfers requires us to consider limiting the number of transfers when to compute the optimal scheme of bus line [1], which can come down to shortest path problem limiting the number of intermediate vertex. And support system of QoS (Quality-of-Service) is playing a more and more important role in communication network. QoS routing problem [2] is to choose transmission path meeting the requirements of QoS service to hop counts, bandwidth, latency, packet loss rate etc. and ensuring effective use of global...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com