19 search results - page 1 / 4 » Experimental Comparison of Shortest Path Approaches for Time... |
ALENEX
2004
13 years 6 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
MICS
2008
13 years 5 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
ATMOS
2007
13 years 7 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortest-path between a source ...
CONSTRAINTS
2006
13 years 5 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...