计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (2): 169-171.
• 网络、通信与安全 • 上一篇 下一篇
张广跃1,汪泽焱2,张申如2
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
ZHANG Guang-yue1,WANG Ze-yan2,ZHANG Shen-ru2
Received:
Revised:
Online:
Published:
Contact:
摘要: DIMCRA算法能很好地解决多个加性约束下的链路分离路径问题的算法。论文对DIMCRA算法进行了理论分析,并证明了存在一类链路分离路径问题是该算法不能解决的。随后在算法中引入了组合差分的概念,对算法进行了优化,并通过实例仿真说明了改进后的算法能弥补原算法的不足。
关键词: 多约束, 链路分离, DIMCRA改进
Abstract: Algorithm DIMCRA can solve link disjoint paths problem with multiple additive constraints well.This article has analyzed algorithm DIMCRA,and has proved that the there is a sort of the link-disjoint problem the algorithm DIMCRA cannot solved.Then author has introduced the combination difference which has optimized the old algorithm,and has given an instance to show that the improved algorithm can improve the algorithm’s performance.
Key words: multiple constraints, link disjoint, DIMCRA-improved
张广跃1,汪泽焱2,张申如2. 一种链路分离路径算法的优化[J]. 计算机工程与应用, 2008, 44(2): 169-171.
ZHANG Guang-yue1,WANG Ze-yan2,ZHANG Shen-ru2. Optimization of link disjoint path algorithm[J]. Computer Engineering and Applications, 2008, 44(2): 169-171.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2008/V44/I2/169