The auction approach for the shortest path problem as introduced by Bert-sekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform signiicantly worse than a state-of-the-art Dijkstra-like reference algorithm .

We designed and implemented a parallel algorithm for solving the single-source shortest paths (SSSP) problem for graphs with nonnegative edge weights, based on Gabow’s scaling algorithm for SSSP. This parallel Gabow algorithm attains a theoretical parallelism of Ω(E/(V lg∆ lgE/D)) in the worst case and Ω(E/(D lgV/D lgE/D lgDelta)with high probability on a random graph. In practice this algorith...

We present a practical algorithm for computing all pairs shortest paths for subset of nodes on road networks. It provides an important improvement for applications such as traffic analysis, where recomputation of shortest paths is the most expensive step that has to be repeated many times. We propose an algorithm that recursively cuts the graph until pieces are small enough to compute shortest ...

In [5], Mehlhorn presented an algorithm for sorting nearly sorted sequences of length n in time 0(n(1+log(F/n») where F is the number of initial inversions. More recently, Dijkstra[3] presented a new algorithm for sorting in situ. Without giving much evidence of it, he claims that his algorithm works well on nearly sorted sequences. In this note we show that smoothsort compares unfavorably to M...

We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algo...

The performance of a new heuristic search algorithm is analyzed. The algorithm uses a formal representation (semantic representation) that contains enough information to compute the heuristic evaluation function h (n). as defined in the context of A *. without requiring a human expert to provide it. The heuristic is computed by �olving less constrained subproblems (auxiliary problems) of the gi...