k-Shortest path algorithms
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 netwo...
| Autor principal: | |
|---|---|
| Formato: | other |
| Idioma: | eng |
| Publicado em: |
2007
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/11305 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11305 |