Sophia Heimann

According to our database, Sophia Heimann authored at least 2 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem.

Sophia Heimann, Hung P. Hoang, Stefan Hougardy

CoRR, July, 2025

2024

The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5.

Sophia Heimann, Hung P. Hoang, Stefan Hougardy

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024