Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11305
DC Field | Value | Language |
---|---|---|
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.grantfulltext | open | - |
item.fulltext | Com Texto completo | - |
item.openairetype | preprint | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_816b | - |
item.cerifentitytype | Publications | - |
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 | - |
Appears in Collections: | FCTUC Matemática - Vários |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
k-Shortest path algorithms.pdf | 192.72 kB | Adobe PDF | View/Open |
Page view(s)
244
checked on Apr 23, 2024
Download(s) 50
379
checked on Apr 23, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.