wchargin/nerdsnipe.md

Last active July 8, 2025 04:51

Star (0) You must be signed in to star a gist
Fork (0) You must be signed in to fork a gist

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/wchargin/686d8b0b5b37cb1e2e9eec84928c0e81.js"></script>
Save wchargin/686d8b0b5b37cb1e2e9eec84928c0e81 to your computer and use it in GitHub Desktop.

Raw

Suppose you have a closed, non self-intersecting 2D curve. Split this curve into N parts, not necessarily equal but with maximum length going to zero. Find a TSP solution (shortest tour containing all the points) on the sampled set. Question: for large N, does the solution mimic the curve?

(Some parts of this are underspecified. Fill in the gaps as you like...)

Spoiler wall...

Author

wchargin commented Jul 8, 2025 •

edited

Loading

I think it's false.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

wchargin/nerdsnipe.md

wchargin commented Jul 8, 2025 • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Uh oh!

wchargin commented Jul 8, 2025 •

edited

Loading