scientific article
From MaRDI portal
Publication:3191603
DOI10.4086/toc.2014.v010a009zbMath1366.68077OpenAlexW1551930937MaRDI QIDQ3191603
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2014.v010a009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Weighted amplifiers and inapproximability results for travelling salesman problem ⋮ New inapproximability bounds for TSP ⋮ Travelling on graphs with small highway dimension
This page was built for publication: