Overview of New Approaches for Approximating TSP

DOI10.1007/978-3-642-45043-3_2zbMath1417.90130OpenAlexW1042055322MaRDI QIDQ2864285

Ola Svensson

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_2

zbMATH Keywords

graph theorytraveling salesman problemapproximation algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Weighted amplifiers and inapproximability results for travelling salesman problem ⋮ A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

This page was built for publication: Overview of New Approaches for Approximating TSP