Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/11305
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Santos, José Luis | - |
dc.date.accessioned | 2009-09-07T10:24:18Z | - |
dc.date.available | 2009-09-07T10:24:18Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Pré-Publicações DMUC. 07-07 (2007) | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/11305 | - |
dc.description.abstract | This paper focuses on algorithms to solve the k-shortest path problem. Three codes are described and compared on random generated and real-world networks. One million paths were ranked in less than 3 seconds (3 microseconds per path), with at most 1 second of preprocessing, on random generated networks with 10 000 nodes. For real-world instances with more than one million nodes, the preprocessing time rises up to 2,7 hours and the CPU time to rank one million paths is less than 30 seconds (30 microseconds per path). | en_US |
dc.description.sponsorship | Centro de Matemática da Universidade de Coimbra | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Centro de Matemática da Universidade de Coimbra | en_US |
dc.rights | openAccess | eng |
dc.subject | Shortest path | en_US |
dc.subject | Ranking path | en_US |
dc.subject | Deviation path | en_US |
dc.title | k-Shortest path algorithms | en_US |
dc.type | preprint | en_US |
uc.controloAutoridade | Sim | - |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | preprint | - |
item.openairecristype | http://purl.org/coar/resource_type/c_816b | - |
crisitem.author.dept | Faculty of Sciences and Technology | - |
crisitem.author.parentdept | University of Coimbra | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.orcid | 0000-0002-2727-6774 | - |
Aparece nas coleções: | FCTUC Matemática - Vários |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
k-Shortest path algorithms.pdf | 192.72 kB | Adobe PDF | Ver/Abrir |
Visualizações de página
263
Visto em 15/out/2024
Downloads 50
401
Visto em 15/out/2024
Google ScholarTM
Verificar
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.