Travelling salesman problem?

Question

What's the difference between the TSP and bottleneck TSP?
I don't quite understand the difference of the definition in wikipedia.

http://en.wikipedia.org/wiki/Traveling_Salesman_Problem

Maybe someone could give me a simple (trivial) example?

Answer 1

The basic TSP asks you to find the Hamilton cycle with the least weight, i.e., the shortest path that visits all the "cities" exactly once.



The bottleneck TSP asks you to find the Hamilton cycle with the smallest weightiest edge, i.e., the path in which the longest leg is shorter than the longest leg in any other path.



Does that help at all?

Answer 2

i'll't imagine of something for polynomial time yet a thanks to reduce the style of available paths calculated: # roads traveled (#rt to any extent further) = #cities - a million take the #r most inexpensive roads and word even if it really is available to make a course. If no longer upload the subsequent chaepest street. If no longer proceed until eventually you could make a course. as quickly because it really is made that's the most inexpensive. this should be a lot swifter because odds are that each and each and every tried course will be a lot shorter than an finished course so the interation might want to no longer be as wide in spite of if the completed style of interations aren't any more signifigantly decreased.

Answer 3

Exactly , TSP u should visit all places once and with least coast ,

but bottlenck TSP isnt

Answer 4

wikipedia never use that **** it could give you wrong info



my friend wrote that george washington rode a tractor:)

Answer 5

hello!!!!!!!!!!!!!!!