Back to Results
First PageMeta Content
Routing algorithms / Network theory / Search algorithms / Shortest path problem / Distance / Graph / Tree / Breadth-first search / Flow network / Graph theory / Mathematics / Theoretical computer science


Point-to-Point Shortest Path Algorithms with Preprocessing Andrew V. Goldberg Microsoft Research – Silicon Valley 1065 La Avenida, Mountain View, CA 94062, USA [removed] URL: http://www.research.microsoft.
Add to Reading List

Document Date: 2007-05-08 19:26:12


Open Document

File Size: 160,66 KB

Share Result on Facebook

City

A∗ Reach / /

Company

Microsoft / /

/

IndustryTerm

reverse search / search method / bidirectional bound algorithm / self-bounding algorithms / forward and reverse search regions / heuristic search / reverse algorithms / goal-directed search / self-bounding algorithm / query algorithm / forward search / road networks / search uses / local search / bidirectional search / search using πt / breadth-first search time / bidirectional algorithm / reverse search key / point-to-point shortest path algorithms / query algorithms / partial-trees algorithm / reach algorithm / partial tree algorithm / search space / search algorithm / near-optimal algorithms / large road networks / /

Person

Andrew V. Goldberg / /

Technology

bidirectional algorithm / bidirectional bound algorithm / self-bounding algorithm / artificial intelligence / preprocessing-based algorithms / reach-based algorithm / partial tree algorithm / self-bounding algorithms / P2P / 3.2 ALT Algorithms / reach-based algorithms / P2P algorithm / bidirectional A∗ search algorithm / partial-trees algorithm / query algorithms / reverse algorithms / preprocessing algorithm / reach algorithm / query algorithm / two algorithms / Point-to-Point Shortest Path Algorithms / /

URL

http /

SocialTag