Pregled bibliografske jedinice broj: 644571
Goal-directed shortest-path queries using precomputed cluster distances
Goal-directed shortest-path queries using precomputed cluster distances // Journal on Experimental Algorithmics, 14 (2009), 3; 1-12 doi:10.1145/1498698.1564502 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 644571 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Goal-directed shortest-path queries using precomputed cluster distances
Autori
Maue, Jens ; Sanders, Peter ; Matijević, Domagoj
Izvornik
Journal on Experimental Algorithmics (1084-6654) 14
(2009), 3;
1-12
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Dijkstra; shortest paths
Sažetak
We demonstrate how Dijkstra's algorithm for shortest path queries can be accelerated by using precomputed shortest path distances. Our approach allows a completely exible tradeo between query time and space consumption for precomputed distances. In particular, sublinear space is sucient to give the search a strong \sense of direction". We evaluate our approach experimentally using large, real-world road networks.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Ustanove:
Sveučilište u Osijeku, Odjel za matematiku
Profili:
Domagoj Matijević
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Scopus