Autor(es):
Pascoal, Marta 
; Captivo, M. ; Clímaco, João
Data: 2006
Identificador Persistente: http://hdl.handle.net/10316/7731
Origem: Estudo Geral - Universidade de Coimbra
Detalhes do Documento
A comprehensive survey on the quickest path problem
Descrição
Abstract 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. http://dx.doi.org/10.1007/s10479-006-0068-x
Abstract 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. http://dx.doi.org/10.1007/s10479-006-0068-x
Tipo de Documento
Artigo
Idioma Inglês
Idioma Inglês
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||