Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Abstract

We present a new family of shortest-route methods, which reduce an upper bound on running time, and make empirical comparisons for a certain class of networks. These methods also allow for exploitation of structure by pruning arcs and/or nodes.