CAJ | 학술논문

在交通运输、邮政和电信网络中，hub作为特殊的设备起着交换、转载和整理的重要作用。该文研究概率网络中的星形2-hub放置问题，网络中的每条边上都有独立的工作概率，给出基于最大概率路图的边扰动算法并在多项式时间内获得最优2-hub树。
재교통운수、유정화전신망락중，hub작위특수적설비기착교환、전재화정리적중요작용。해문연구개솔망락중적성형2-hub방치문제，망락중적매조변상도유독립적공작개솔，급출기우최대개솔로도적변우동산법병재다항식시간내획득최우2-hub수。
In transportation , postal and telecommunication networks , hubs play an important role by serving as special facilities, e.g., switching, transshipment and sorting points , etc.This paper studies the star 2-hub location problem in probabilistic networks where every edge has an independent working probability , and designs an edge-turbulence algorithm based on the maximum reliability path graph to compute an optimal 2-hub tree in polynomial time .