Christopher M. Dellin

A Unifying Formalism for Shortest Path Problems with Expensive Edge\n Evaluations via Lazy Best-First Search over Paths with Edge Selectors

2016 · arXiv (Cornell University)

While the shortest path problem has myriad applications, the computational\nefficiency of suitable algorithms depends intimately on the underlying problem\ndomain. In this paper, we focus on domains where evaluating the edge weight\nfunction dominates algorithm running time. …