Reach for A*: Efficient point-to-point shortest path algorithms

Andrew V. Goldberg; Haim Kaplan; Renato F. Werneck

doi:10.1137/1.9781611972863.13

Reach for A*: Efficient point-to-point shortest path algorithms

Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck

School of Computer Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce vertex reaches. Our modifications greatly improve both preprocessing and query times. The resulting algorithm is as fast as the best previous method, due to Sanders and Schultes [28]. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.

Original language	English
Title of host publication	Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Publisher	Society for Industrial and Applied Mathematics (SIAM)
Pages	129-143
Number of pages	15
ISBN (Print)	0898716101, 9780898716108
DOIs	https://doi.org/10.1137/1.9781611972863.13
State	Published - 2006
Event	8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics - Miami, FL, United States Duration: 21 Jan 2006 → 21 Jan 2006

Publication series

Name	Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Volume	2006

Conference

Conference	8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Country/Territory	United States
City	Miami, FL
Period	21/01/06 → 21/01/06

Access to Document

10.1137/1.9781611972863.13

Cite this

Goldberg, A. V., Kaplan, H., & Werneck, R. F. (2006). Reach for A*: Efficient point-to-point shortest path algorithms. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics (pp. 129-143). (Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics; Vol. 2006). Society for Industrial and Applied Mathematics (SIAM). https://doi.org/10.1137/1.9781611972863.13

Goldberg, Andrew V. ; Kaplan, Haim ; Werneck, Renato F. / Reach for A* : Efficient point-to-point shortest path algorithms. Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Society for Industrial and Applied Mathematics (SIAM), 2006. pp. 129-143 (Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics).

@inproceedings{b5555cfafbc34b8b81410786f6a9b387,

title = "Reach for A*: Efficient point-to-point shortest path algorithms",

abstract = "We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce vertex reaches. Our modifications greatly improve both preprocessing and query times. The resulting algorithm is as fast as the best previous method, due to Sanders and Schultes [28]. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.",

author = "Goldberg, {Andrew V.} and Haim Kaplan and Werneck, {Renato F.}",

year = "2006",

doi = "10.1137/1.9781611972863.13",

language = "אנגלית",

isbn = "0898716101",

series = "Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

pages = "129--143",

booktitle = "Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics",

address = "ארצות הברית",

note = "null ; Conference date: 21-01-2006 Through 21-01-2006",

}

Goldberg, AV, Kaplan, H & Werneck, RF 2006, Reach for A*: Efficient point-to-point shortest path algorithms. in Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics, vol. 2006, Society for Industrial and Applied Mathematics (SIAM), pp. 129-143, 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics, Miami, FL, United States, 21/01/06. https://doi.org/10.1137/1.9781611972863.13

Reach for A* : Efficient point-to-point shortest path algorithms. / Goldberg, Andrew V.; Kaplan, Haim; Werneck, Renato F.

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Society for Industrial and Applied Mathematics (SIAM), 2006. p. 129-143 (Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Reach for A*

AU - Goldberg, Andrew V.

AU - Kaplan, Haim

AU - Werneck, Renato F.

PY - 2006

Y1 - 2006

N2 - We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce vertex reaches. Our modifications greatly improve both preprocessing and query times. The resulting algorithm is as fast as the best previous method, due to Sanders and Schultes [28]. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.

AB - We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce vertex reaches. Our modifications greatly improve both preprocessing and query times. The resulting algorithm is as fast as the best previous method, due to Sanders and Schultes [28]. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.

UR - http://www.scopus.com/inward/record.url?scp=33646824560&partnerID=8YFLogxK

U2 - 10.1137/1.9781611972863.13

DO - 10.1137/1.9781611972863.13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33646824560

SN - 0898716101

SN - 9780898716108

T3 - Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

SP - 129

EP - 143

BT - Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

PB - Society for Industrial and Applied Mathematics (SIAM)

Y2 - 21 January 2006 through 21 January 2006

ER -

Goldberg AV, Kaplan H, Werneck RF. Reach for A*: Efficient point-to-point shortest path algorithms. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Society for Industrial and Applied Mathematics (SIAM). 2006. p. 129-143. (Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics). https://doi.org/10.1137/1.9781611972863.13

Reach for A*: Efficient point-to-point shortest path algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this