#### DMCA

## Efficient route compression for hybrid route planning (2012)

Venue: | In MedAlg |

Citations: | 1 - 0 self |

### Citations

167 | Computing the shortest path: A search meets graph theory.
- Goldberg, Harrelson
- 2005
(Show Context)
Citation Context ...t the low number of via nodes also helps to keep the communication time small. We also describe a Dijkstra-based method that runs much slower than the CH-based one. But applying Arc-Flags [19] or ALT =-=[20]-=-, two algorithmic techniques for fast and exact route planning, may bring a substantial speedup there. An interesting question is, whether subpaths that are uniquely representable with CH can be compu... |

120 | Contraction hierarchies: Faster and simpler hierarchical routing in road networks.
- Geisberger, Sanders, et al.
- 2008
(Show Context)
Citation Context ...nd exact1 computation of optimal routes. There, it is enough to decompress the first route segment fast. All other segments can be decompressed successively when driving. Contraction hierarchies (CH) =-=[13, 14]-=- is a fast and exact method for route planning which has also been adapted to run efficiently on mobile devices. Using these mobile CH the client should be able to decompress each segment of the route... |

64 | Partitioning Graphs to Speedup Dijkstra’s Algorithm.
- Mohring, Schilling, et al.
- 2006
(Show Context)
Citation Context ...cy. Note that the low number of via nodes also helps to keep the communication time small. We also describe a Dijkstra-based method that runs much slower than the CH-based one. But applying Arc-Flags =-=[19]-=- or ALT [20], two algorithmic techniques for fast and exact route planning, may bring a substantial speedup there. An interesting question is, whether subpaths that are uniquely representable with CH ... |

44 | R.F.: Customizable route planning.
- Delling, Goldberg, et al.
- 2011
(Show Context)
Citation Context ...it. The original publication is available at www.springerlink.com. 2 G.V. Batz, R. Geisberger, D. Luxen, P. Sanders, R. Zubkov are assessed with respect to multiple costs, customizable route planning =-=[10]-=- where cost functions can be altered rapidly, or the computation of alternative routes [11, 12]. Possible benefits are, for example, – that routes are optimized with respect to the time of day which m... |

26 |
Algorithms and Data Structures: The Basic Toolbox
- Mehlhorn, Sanders
- 2008
(Show Context)
Citation Context ...., removed from the priority queue, Line 6), its tentative cost equals the cost of a shortest path and changes no more. A detailed explanation of Dijkstra’s algorithm can be found in textbooks (e.g., =-=[18]-=-). Our modified Dijkstra starts from u1 and maintains an index k which is initialized with n and repeatedly decreased until 〈u1, . . . , uk〉 is a unique shortest prefix. Lemma 3. For u ∈ V let Pu := 〈... |

23 | Time-Dependent Contraction Hierarchies. - Batz, Delling, et al. - 2009 |

22 |
Exact Routing in Large Road Networks Using Contraction Hierarchies.
- Geisberger, Sanders, et al.
- 2012
(Show Context)
Citation Context ...nd exact1 computation of optimal routes. There, it is enough to decompress the first route segment fast. All other segments can be decompressed successively when driving. Contraction hierarchies (CH) =-=[13, 14]-=- is a fast and exact method for route planning which has also been adapted to run efficiently on mobile devices. Using these mobile CH the client should be able to decompress each segment of the route... |

19 | Mobile Route Planning
- Sanders, Schultes, et al.
- 2008
(Show Context)
Citation Context ...hod for route planning which has also been adapted to run efficiently on mobile devices. Using these mobile CH the client should be able to decompress each segment of the route within less than 0.1 s =-=[15]-=-. From the drivers point of view this is as good as instantaneous. Note that Dijkstra’s well known algorithm is not an alternative. Though it computes optimal routes, it has running times of more than... |

13 | Time-Dependent SHARC-Routing. Algorithmica, - Delling - 2009 |

13 | Candidate sets for alternative routes in road networks
- Luxen, Schieferdecker
- 2012
(Show Context)
Citation Context ...er, D. Luxen, P. Sanders, R. Zubkov are assessed with respect to multiple costs, customizable route planning [10] where cost functions can be altered rapidly, or the computation of alternative routes =-=[11, 12]-=-. Possible benefits are, for example, – that routes are optimized with respect to the time of day which means that congestions can be avoided based on statistical data, – that inconvenient roads can b... |

12 | Distributed time-dependent contraction hierarchies - Kieritz, Luxen, et al. - 2010 |

11 | Time-dependent contraction hierarchies and approximation. - Batz, Geisberger, et al. - 2010 |

11 | Pareto Paths with SHARC.
- Delling, Wagner
- 2009
(Show Context)
Citation Context ...re time, flexible route planning [8] where routes depend on a freely selectable parameter which models a tradeoff between energy consumption and travel time for example, multi-criteria route planning =-=[9]-=- where routes ? Partially supported by DFG project SA 933/5-1,2. This is a slightly extended version containing some details we omitted in the original version due to page limit. The original publicat... |

11 | On k-skip shortest paths.
- Tao, Sheng, et al.
- 2011
(Show Context)
Citation Context ... a technical report [16]. To our knowledge, there is no other publication directly covering the efficient representation of routes beyond traditional data compression and error-correction. Tao et al. =-=[17]-=- show how to efficiently compute a representation that includes at least one out of every k consecutive nodes. While this can be seen as a compact representation of a shortest path it is not clear how... |

10 | Route Planning with Flexible Objective Functions.
- Geisberger, Kobitzsch, et al.
- 2010
(Show Context)
Citation Context ...ng them to work well on mobile devices is usually not trivial – if at all possible. Examples are time-dependent route planning [1–7] where routes depend on the departure time, flexible route planning =-=[8]-=- where routes depend on a freely selectable parameter which models a tradeoff between energy consumption and travel time for example, multi-criteria route planning [9] where routes ? Partially support... |

3 | Space-efficient SHARC-routing - Brunel, Delling, et al. - 2010 |

2 | Time-Dependent Route Planning with Generalized Objective Functions - Batz, Sanders |

1 | P.: Compressed Transmission of Route Descriptions
- Batz, Geisberger, et al.
- 2010
(Show Context)
Citation Context ...sion is quite low if CH are used to realize the subroutine in the generic binary scheme (Sect. 6). Related Work. We described some of the ideas presented in this work previously in a technical report =-=[16]-=-. To our knowledge, there is no other publication directly covering the efficient representation of routes beyond traditional data compression and error-correction. Tao et al. [17] show how to efficie... |