# A quasi-polynomial algorithm for well-spaced hyperbolic TSP

@article{KisfaludiBak2020AQA, title={A quasi-polynomial algorithm for well-spaced hyperbolic TSP}, author={S{\'a}ndor Kisfaludi-Bak}, journal={ArXiv}, year={2020}, volume={abs/2002.05414} }

We study the traveling salesman problem in the hyperbolic plane of Gaussian curvature $-1$. Let $\alpha$ denote the minimum distance between any two input points. Using a new separator theorem and a new rerouting argument, we give an $n^{O(\log^2 n)\max(1,1/\alpha)}$ algorithm for Hyperbolic TSP. This is quasi-polynomial time if $\alpha$ is at least some absolute constant, and it grows to $n^{O(\sqrt{n})}$ as $\alpha$ decreases to $\log^2 n/\sqrt{n}$. (For even smaller values of $\alpha$, we… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv