The success of the IoT world requires service provision attributed with ubiquity, reliability,
high-performance, efficiency, and scalability. In order to accomplish this attribution, future …

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 …

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 …

Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

Let G=(V, E) be an undirected weighted graph with| V|= n and| E|= m. Let k≥ 1 be an
integer. We show that G=(V, E) can be preprocessed in O (kmn 1/k) expected time …

Reachability and distance queries in graphs are fundamental to numerous applications,
ranging from geographic navigation systems to Internet routing. Some of these applications …

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. A plethora of shortest-path algorithms is studied in the literature that span across …

Abstract Abraham et al.[SODA 2010] have recently presented a theoretical analysis of
several practical point-to-point shortest path algorithms based on modeling road networks …

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 present a near linear time algorithm for constructing hierarchical nets in finite metric
spaces with constant doubling dimension. This data-structure is then applied to obtain …