Timeline for Traveling Salesman's Tour Approx Algorithm: is this really a Hamiltonian Path?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2013 at 16:58 | vote | accept | mlstudent | ||
| Nov 19, 2013 at 16:58 | comment | added | mlstudent | Oh, I understand it now. I didn't realize that you can make an edge between any two nodes. | |
| Nov 19, 2013 at 16:38 | comment | added | mlstudent | It seems this version of the problem leaves out that the cost function should satisfy the triangel inequality. However, I'm confused because say we have this graph en.wikipedia.org/wiki/File:Minimum_spanning_tree.svg and we start with the leftmost node, won't we get the path shown? | |
| Nov 19, 2013 at 10:58 | history | answered | David Richerby | CC BY-SA 3.0 |
