not direclty the TSP problem, but you can create the "input" for your TSP problem, i.e. if you have a set of nodes T which should be visited by the TSP route, you can compute the TxT distance table (very fast).
Then you need a TSP algorithm which computes a tsp route on the G'=(T,TxT) graph (which is not part of the presentation). There exists algorithms which can solve this problem normally in reasonable time (although the TSP problem is NP-hard).
Audio problems are somewhat common in Google Talks, unfortunately. Wish they did something about it. :(
luiza2166 2 years ago 2
can you apply the contraction hierarchies to TSP problems?
hurlm 2 years ago
not direclty the TSP problem, but you can create the "input" for your TSP problem, i.e. if you have a set of nodes T which should be visited by the TSP route, you can compute the TxT distance table (very fast).
Then you need a TSP algorithm which computes a tsp route on the G'=(T,TxT) graph (which is not part of the presentation). There exists algorithms which can solve this problem normally in reasonable time (although the TSP problem is NP-hard).
eciOkMcOwnage 2 years ago
I don't mind this new format, but the audio really needs to be improved.
bluezio123 2 years ago
interesting presentation, but the audio is bad
calin2k 2 years ago 3
you actually watchd it all ?
itsBIGbouncedawg 2 years ago