Corpus ID: 211096831

# 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}
}
• 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

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

## A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs

• Mathematics, Computer Science
• STOC 2018
• 2018

## An ETH-Tight Exact Algorithm for Euclidean TSP

• Computer Science, Mathematics
• 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018

## New Inapproximability Bounds for TSP

• Computer Science, Mathematics
• ISAAC
• 2013

## The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme

• Mathematics, Computer Science
• STOC '12
• 2012

## Algorithms on negatively curved spaces

• Mathematics, Computer Science
• 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
• 2006

## Exact algorithms for the Hamiltonian cycle problem in planar graphs

• Mathematics, Computer Science
• Oper. Res. Lett.
• 2006

## The searching over separators strategy to solve some NP-hard problems in subexponential time

• Computer Science, Mathematics
• Algorithmica
• 2005
VIEW 2 EXCERPTS

## 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

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