My question is - if we consider the Travelling salesman problem without the returning to the starting point part does the greedy (nearest neighbor) algorithm solves this problem correctly ? In a previous thread someone stated that this problem is equivalent to the shortest Hamiltonian path, but I think we dont need the restriction on visiting every node exactly once, so I would like a better explenation.
Thank you,