An improved upper bound for the universal TSP on the grid

DOI10.1137/1.9781611974782.64zbMATH Open1415.90098OpenAlexW4240064670MaRDI QIDQ4575804FDOQ4575804

Authors: George Christodoulou, Alkmini Sgouritsa 

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://doi.org/10.1137/1.9781611974782.64

Recommendations

• Improved lower bounds for the universal and a priori TSP
• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
• Algorithms for the universal and a priori TSP
• General spacefilling curve heuristics and limit theory for the traveling salesman problem
• scientific article; zbMATH DE number 4087452

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (5)

• Assouad-Nagata dimension and gap for ordered metric spaces
• Spaces that can be ordered effectively: virtually free groups and hyperbolicity
• An improved upper bound for the universal TSP on the grid
• Improved lower bounds for the universal and a priori TSP
• Designing networks with good equilibria under uncertainty

This page was built for publication: An improved upper bound for the universal TSP on the grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575804)