Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (34): 46-48.
• 学术探讨 • Previous Articles Next Articles
CHEN Guang-ting,LIU Zhou,ZHANG Yue
Received:
Revised:
Online:
Published:
Contact:
陈光亭,柳 舟,张 玥
通讯作者:
Abstract: The bottleneck expanding problem is an important problem in QoS.Presents the model of this problem with quickest path.The NP completeness is proved and a pseudopolynomial time algorithm is designed.
Key words: quickest path, bottleneck expanding problem, pseudo-polynomial algorithm
摘要： 网络瓶颈扩容问题是QoS所关心的问题。就多路传输快速路的瓶颈扩容问题给出了相应的数学模型，证明该问题是NP-难问题并给出一个伪多项式时间算法。
关键词: 快速路, 瓶颈扩容问题, 伪多项式时间算法
CHEN Guang-ting,LIU Zhou,ZHANG Yue. Bottleneck expanding problem with quickest path model[J]. Computer Engineering and Applications, 2007, 43(34): 46-48.
陈光亭,柳 舟,张 玥. 多路传输快速路的瓶颈扩容问题[J]. 计算机工程与应用, 2007, 43(34): 46-48.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I34/46
