A comprehensive survey on the quickest path problem
A comprehensive survey on the quickest path problem
复制标题
最快路径问题综合考察
DOI：
--
复制
发表时间：
2006
影响因子：
4.8
通讯作者：
J. Clímaco
中科院分区：
文献类型：
--
作者：
Marta M. B. Pascoal;M. Captivo;J. Clímaco
这项工作是对特殊的Minsum-Maxmin双晶格问题的调查，称为最快的路径问题，可以对网络两个节点之间的数据传输进行建模。此外，作者回顾了对K快速路径和K快速无环路径进行排名的问题，并根据最差的复杂性顺序对其进行比较。提出的分类导致提出了已知的K快速无环路算法的新变体的提议。最后，提到了最快路径算法的应用，以及一些比较经验结果。
This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results.