(classic problem)
Definition: Find a tour where no edge is more costly than some (bottleneck) amount.
See also traveling salesman.
Note: Defined in comp.theory by Hai Zhou (haizhou@cs.utexas.edu) November 1998. See [CLR90, page 974].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:48:39 2004.
HTML page formatted Wed Oct 26 09:47:16 2005.
Cite this as:
Paul E. Black, "bottleneck traveling salesman", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bottleneckTravelingSales.html
