A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP.

Júlia Baligács Yann Disser Andreas Emil Feldmann Anna Zych-Pawlewicz

Published in: CoRR (2024)

Keyphrases

traveling salesman problem
approximation algorithms
euclidean distance
np hard
ant colony optimization
error bounds
real time
closed form
euclidean space
combinatorial optimization
approximation error
upper bound
approximation ratio
travelling salesman