ON THE BOTTLENECK SHORTEST PATH PROBLEM

The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capaci- ty of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze the complexity of the problem, its relation to the Shortest Path Problem, and the impact of the underlying machine/computation model.