Corpus ID: 214612441

Euclidean TSP in Narrow Strip

@article{Alkema2020EuclideanTI,
  title={Euclidean TSP in Narrow Strip},
  author={H. Alkema and M. Berg and S{\'a}ndor Kisfaludi-Bak},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.09948}
}
  • H. Alkema, M. Berg, Sándor Kisfaludi-Bak
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • We investigate how the complexity of Euclidean TSP for point sets $P$ inside the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width $\delta$. We obtain two main results. First, for the case where the points have distinct integer $x$-coordinates, we prove that a shortest bitonic tour (which can be computed in $O(n\log^2 n)$ time using an existing algorithm) is guaranteed to be a shortest tour overall when $\delta\leq 2\sqrt{2}$, a bound which is best possible. Second, we… CONTINUE READING

    References

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