The traveling salesman problem
From MaRDI portal
Publication:5415508
DOI10.1145/2213977.2214038zbMath1286.68177OpenAlexW2028047126MaRDI QIDQ5415508
Robert Krauthgamer, Lee-Ad J. Gottlieb, Yair Bartal
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214038
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (8)
A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ A PTAS for the Steiner Forest Problem in Doubling Metrics ⋮ Fractal dimension and lower bounds for geometric problems ⋮ Unnamed Item ⋮ Travelling on graphs with small highway dimension ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ ⋮ Low dimensional embeddings of doubling metrics
This page was built for publication: The traveling salesman problem
