https://scholars.lib.ntu.edu.tw/handle/123456789/488272
標題: | Algorithms for the constrained quickest path problem and the enumeration of quickest paths. | 作者: | Hung, Yung-Chen GEN-HUEY CHEN |
公開日期: | 1994 | 卷: | 21 | 期: | 2 | 起(迄)頁: | 113-118 | 來源出版物: | Computers & OR | 摘要: | The quickest path problem, which was originally proposed by Chen and Chin, is a variant of the shortest path problem. Its objective is to find quickest paths in a network to transmit a given amount of data such that the transmission time is minimized. If the quickest paths are required to go through a specified path, then the restricted problem is called the constrained quickest path problem. In this paper, for all pairs of nodes in a network N, an O(mn2) time algorithm is first presented to find constrained quickest paths, and then an O(k2mn2) time algorithm is presented to enumerate the first k quickest paths. Our results improve previous results by Rosen, Sun and Xue. © 1993. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0028381241&doi=10.1016%2f0305-0548%2894%2990045-0&partnerID=40&md5=96f72126fb8467f10a094f527d217c40 | DOI: | 10.1016/0305-0548(94)90045-0 | SDG/關鍵字: | Combinatorial mathematics; Computational complexity; Constraint theory; Data communication systems; Operations research; Optimization; Sequential switching; Telecommunication networks; Constrained quickest path problem; Nodes; Sequential algorithm; Shortest path problem; Time algorithm; Algorithms |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。