Maximum Scatter TSP in Doubling Metrics

DOI10.1137/1.9781611974782.10zbMath1411.68197arXiv1512.02963OpenAlexW2471508234MaRDI QIDQ4575744

László Kozma, Tobias Mömke

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.02963

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

A 3/2-Approximation for the Metric Many-Visits Path TSP ⋮ The traveling salesman problem on grids with forbidden neighborhoods ⋮ A Modern View on Stability of Approximation ⋮ Many Visits TSP Revisited ⋮ Many-visits TSP revisited

This page was built for publication: Maximum Scatter TSP in Doubling Metrics