In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …

Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …

We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

Nowadays, with advanced information technologies deployed citywide, large data volumes
and powerful computational resources are intelligentizing modern city development. As an …

We study hierarchical hub labelings for computing shortest paths. Our new theoretical
insights into the structure of hierarchical labels lead to faster preprocessing algorithms …

We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

We propose the first routing engine for computing driving directions in large-scale road
networks that satisfies all requirements of a real-world production system. It supports …

Travelling is a critical component of daily life. With new technology, personalized travel route
recommendations are possible and have become a new research area. A personalized …

We consider the problem of quickly computing shortest paths in weighted graphs. Often, this
is achieved in two phases:(1) derive auxiliary data in an expensive preprocessing phase …