An Improved Upper Bound for the Universal TSP on the Grid

DOI10.1137/1.9781611974782.64zbMath1415.90098OpenAlexW4240064670MaRDI QIDQ4575804

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

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)

Related Items (3)

Assouad-Nagata dimension and gap for ordered metric spaces ⋮ Spaces that can be ordered effectively: virtually free groups and hyperbolicity ⋮ Designing Networks with Good Equilibria under Uncertainty

This page was built for publication: An Improved Upper Bound for the Universal TSP on the Grid