A comprehensive survey on the quickest path problem

Detalhes bibliográficos
Autor(a) principal: Pascoal, Marta
Data de Publicação: 2006
Outros Autores: Captivo, M., Clímaco, João
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/7731
https://doi.org/10.1007/s10479-006-0068-x
Resumo: 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.
id RCAP_a97f59ddb946eef4db516be055f13fed
oai_identifier_str oai:estudogeral.uc.pt:10316/7731
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A comprehensive survey on the quickest path problemAbstract 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.2006info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/7731http://hdl.handle.net/10316/7731https://doi.org/10.1007/s10479-006-0068-xengAnnals of Operations Research. 147:1 (2006) 5-21Pascoal, MartaCaptivo, M.Clímaco, Joãoinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-05-29T10:04:36Zoai:estudogeral.uc.pt:10316/7731Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:00:43.803658Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A comprehensive survey on the quickest path problem
title A comprehensive survey on the quickest path problem
spellingShingle A comprehensive survey on the quickest path problem
Pascoal, Marta
title_short A comprehensive survey on the quickest path problem
title_full A comprehensive survey on the quickest path problem
title_fullStr A comprehensive survey on the quickest path problem
title_full_unstemmed A comprehensive survey on the quickest path problem
title_sort A comprehensive survey on the quickest path problem
author Pascoal, Marta
author_facet Pascoal, Marta
Captivo, M.
Clímaco, João
author_role author
author2 Captivo, M.
Clímaco, João
author2_role author
author
dc.contributor.author.fl_str_mv Pascoal, Marta
Captivo, M.
Clímaco, João
description 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.
publishDate 2006
dc.date.none.fl_str_mv 2006
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/7731
http://hdl.handle.net/10316/7731
https://doi.org/10.1007/s10479-006-0068-x
url http://hdl.handle.net/10316/7731
https://doi.org/10.1007/s10479-006-0068-x
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Annals of Operations Research. 147:1 (2006) 5-21
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133897598959616

Registros relacionados