Results 1  10
of
15
A HubBased Labeling Algorithm for Shortest Paths on Road Networks
, 2010
"... Abstract. Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical pointtopoint shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this a ..."
Abstract

Cited by 46 (15 self)
 Add to MetaCart
Abstract. Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical pointtopoint shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this algorithm existed, it has the best time bounds. This paper describes an implementation of the labeling algorithm that is faster than any existing method on continental road networks. 1
PHAST: hardwareaccelerated shortest path trees
 J. PARALLEL DISTRIB. COMPUT
, 2013
"... We present a novel algorithm to solve the nonnegative singlesource shortest path problem on road networks and graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from a given source in the graph with essentially a linear sweep over all vertices. Becaus ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
(Show Context)
We present a novel algorithm to solve the nonnegative singlesource shortest path problem on road networks and graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from a given source in the graph with essentially a linear sweep over all vertices. Because this sweep is independent of the source, we are able to reorder vertices in advance to exploit locality. Moreover, our algorithm takes advantage of features of modern CPU architectures, such as SSE and multiple cores. Compared to Dijkstra’s algorithm, our method needs fewer operations, has better locality, and is better able to exploit parallelism at multicore and instruction levels. We gain additional speedup when implementing our algorithm on a GPU, where it is up to three orders of magnitude faster than Dijkstra’s algorithm on a highend CPU. This makes applications based on allpairs shortestpaths practical for continentalsized road networks. Several algorithms, such as computing the graph diameter, arc flags, or exact reaches, can be greatly accelerated by our method.
Hierarchical Hub Labelings for Shortest Paths
 PROCEEDINGS OF THE 20TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA’12), VOLUME 7501 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2012
"... We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs. We also find smaller labels for road networks, impro ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
(Show Context)
We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs. We also find smaller labels for road networks, improving the query speed.
Startrack: a framework for enabling trackbased applications
 In MobiSys ’09: Proceedings of the 7th international conference on Mobile systems, applications, and services
, 2009
"... Mobile devices are increasingly equipped with hardware and software services allowing them to determine their locations, but support for building locationaware applications remains rudimentary. This paper proposes tracks of location coordinates as a highlevel abstraction for a new class of mobile ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
(Show Context)
Mobile devices are increasingly equipped with hardware and software services allowing them to determine their locations, but support for building locationaware applications remains rudimentary. This paper proposes tracks of location coordinates as a highlevel abstraction for a new class of mobile applications including ride sharing, locationbased collaboration, and health monitoring. Each track is a sequence of entries recording a person’s time, location, and applicationspecific data. StarTrack provides applications with a comprehensive set of operations for recording, comparing, clustering and querying tracks. StarTrack can efficiently operate on thousands of tracks.
Faster Customization of Road Networks
 In Proc. SEA, LNCS
, 2013
"... Abstract. A wide variety of algorithms can answer exact shortestpath queries in real time on continental road networks, but they typically require significant preprocessing effort. Recently, the customizable route planning (CRP) approach has reduced the time to process a new cost function to a frac ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
(Show Context)
Abstract. A wide variety of algorithms can answer exact shortestpath queries in real time on continental road networks, but they typically require significant preprocessing effort. Recently, the customizable route planning (CRP) approach has reduced the time to process a new cost function to a fraction of a minute. We reduce customization time even further, by an order of magnitude. This makes it worthwhile even when a single query is to be run, enabling a host of new applications. 1
Faster Batched Shortest Paths in Road Networks
 ATMOS
, 2011
"... We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (onetomany queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (onetomany queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent onetoall algorithm), called RPHAST, has the best performance in most cases, often by orders of magnitude. When used to compute distance tables (manytomany queries), RPHAST often outperforms all previous approaches.
HLDB: Locationbased services in databases
 In Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS’12), 339–348. ACM Press. Best Paper Award
, 2012
"... This paper introduces HLDB, the first practical system that can answer exact spatial queries on continental road networks entirely within a database. HLDB is based on hub labels (HL), the fastest pointtopoint algorithm for road networks, and its queries are implemented (quite naturally) in stan ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
This paper introduces HLDB, the first practical system that can answer exact spatial queries on continental road networks entirely within a database. HLDB is based on hub labels (HL), the fastest pointtopoint algorithm for road networks, and its queries are implemented (quite naturally) in standard SQL. Within the database, HLDB answers exact distance queries and retrieves full shortestpath descriptions in real time, even on networks with tens of millions of vertices. The basic algorithm can be extended in a natural way (still in SQL) to answer much more sophisticated queries, such as finding the ten closest fastfood restaurants. We also introduce efficient new HLbased algorithms for even harder problems, such as best via point, ride sharing, and point of interest prediction. The HLDB framework makes it easy to implement these algorithms in SQL, enabling interactive applications on continental road networks.
Algorithms for Hub Label Optimization
"... Cohen et al. developed an O(log n)approximation algorithm for minimizing the total hub label size (ℓ1 norm). We give O(log n)approximation algorithms for the problems of minimizing the maximum label (ℓ ∞ norm) and minimizing ℓp and ℓq norms simultaneously. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Cohen et al. developed an O(log n)approximation algorithm for minimizing the total hub label size (ℓ1 norm). We give O(log n)approximation algorithms for the problems of minimizing the maximum label (ℓ ∞ norm) and minimizing ℓp and ℓq norms simultaneously.
Customizable PointofInterest Queries in Road Networks
"... We present a unified framework for dealing with exact pointofinterest (POI) queries in dynamic continental road networks within interactive applications. We show that partitionbased algorithms developed for pointtopoint shortest path computations can be naturally extended to handle augmented q ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We present a unified framework for dealing with exact pointofinterest (POI) queries in dynamic continental road networks within interactive applications. We show that partitionbased algorithms developed for pointtopoint shortest path computations can be naturally extended to handle augmented queries such as finding the closest restaurant or the best post office to stop on the way home, always ranking POIs according to a userdefined cost function. Our solution allows different tradeoffs between indexing effort (time and space) and query time. Our most flexible variant allows the road network to change frequently (to account for traffic information or personalized cost functions) and the set of POIs to be specified at query time. Even in this fully dynamic scenario, our solution is fast enough for interactive applications on continental road networks.
StarTrack: A Framework for Enabling TrackBased Applications Ganesh Ananthanarayanan ∗ , Maya Haridasan, Iqbal Mohomed,
"... Mobile devices are increasingly equipped with hardware and software services allowing them to determine their locations, but support for building locationaware applications remains rudimentary. This paper proposes tracks of location coordinates as a highlevel abstraction for a new class of mobile ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Mobile devices are increasingly equipped with hardware and software services allowing them to determine their locations, but support for building locationaware applications remains rudimentary. This paper proposes tracks of location coordinates as a highlevel abstraction for a new class of mobile applications including ride sharing, locationbased collaboration, and health monitoring. Each track is a sequence of entries recording a person’s time, location, and applicationspecific data. StarTrack provides applications with a comprehensive set of operations for recording, comparing, clustering and querying tracks. StarTrack can efficiently operate on thousands of tracks. 1