Join
The complexity of the longest tour through points in the plane
Determine whether finding the longest tour through n points in the plane, with Euclidean distances, is NP-hard or solvable in polynomial time.
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault