Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
298 views

Opposite-nearest neighbor algorithm vs. nearest neighbor algorithm

Take the traveling salesman problem, but with three slight twists: You can choose a different start vertex for each of the two algorithms. Each path from one vertex to another is of unique, arbitrary ...