Corpus ID: 211096831

A quasi-polynomial algorithm for well-spaced hyperbolic TSP

  title={A quasi-polynomial algorithm for well-spaced hyperbolic TSP},
  author={S{\'a}ndor Kisfaludi-Bak},
  • Sándor Kisfaludi-Bak
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • 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


    Publications referenced by this paper.

    An ETH-Tight Exact Algorithm for Euclidean TSP

    Algorithms on negatively curved spaces

    Papadimitriou , and Jayme Luiz Szwarcfiter . Hamilton paths in grid graphs

    • Alon Itai, H Christos
    • Journal of Computer and System Sciences
    • 2001

    Complexity of k-SAT

    • Russell Impagliazzo, Ramamohan Paturi
    • Mathematics, Computer Science
    • Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
    • 1999