Sciweavers

Share
9 search results - page 1 / 2
» Speeding Up Shortest Path Search in Public Transport Network...
Sort
View
DATESO
2009
114views Database» more  DATESO 2009»
9 years 2 days ago
Speeding Up Shortest Path Search in Public Transport Networks
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
Vladislav Martinek, Michal Zemlicka
PVLDB
2010
146views more  PVLDB 2010»
9 years 20 days ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
9 years 8 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
9 years 3 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
9 years 3 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
books