Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Heuristic search for one-to-many shortest path queries
Roni Stern
, Meir Goldenberg
, Abdallah Saffidine
, Ariel Felner
Ben-Gurion University of the Negev
Palo Alto Research Center
Jerusalem College of Technology
University of New South Wales
Research output
:
Contribution to journal
›
Article
›
peer-review
3
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Heuristic search for one-to-many shortest path queries'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Heuristic Search
100%
Shortest Path Query
100%
Many-to-many
100%
Shortest Path Problem
66%
Shortest Path
33%
K Shortest Path Problem
33%
Road Network
33%
One-at-a-time
33%
Memory Requirements
33%
Search Approach
33%
Runtime Requirements
33%
Computer Science
Shortest Path Problem
100%
Heuristic Search
100%
Fundamental Question
33%
Search Technique
33%
Heuristic Estimate
33%
Preprocessing
33%
Sufficient Condition
33%
Memory Requirement
33%