Published on *Computer Science Department at Princeton University* (http://www.cs.princeton.edu)

A bottleneck optimization problem on a graph with edge costs is the problem of finding a subgraph of a certain kind that minimizes the maximum edge cost in the subgraph. The bottleneck objective contrasts with the more common objective of minimizing the sum of edge costs. We propose fast algorithms for two

bottleneck optimization problems. For the problem of finding a bottleneck spanning tree in a directed graph of n vertices and m edges, we propose an O(min{n log n + m, mlog* n})-time algorithm. For the bottleneck maximum cardinality matching problem, we propose an O((n log n)1/2m)-time algorithm.

**Links**

[1] http://www.cs.princeton.edu/research/techreps/author/670

[2] http://www.cs.princeton.edu/research/techreps/author/384

[3] ftp://ftp.cs.princeton.edu/techreports/1987/104.pdf