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 (email@example.com) November 1998. See [CLR90, page 974].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.
Cite this as:
Paul E. Black, "bottleneck traveling salesman", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/bottleneckTravelingSales.html