Analysis of a near-metric TSP approximation algorithm

DOI10.1051/ITA/2013040zbMATH Open1286.90131OpenAlexW2066949747MaRDI QIDQ5397720

Sacha Krug

Publication date: 24 February 2014

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ef0347c759f8d26df1c938e16a21721b89248f6b

zbMATH Keywords

combinatorial optimizationgraph theorytraveling salesman problemapproximation algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

A (slightly) improved approximation algorithm for metric TSP ⋮ Fine-grained Complexity Analysis of Two Classic TSP Variants

This page was built for publication: Analysis of a near-metric TSP approximation algorithm

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