scientific article
From MaRDI portal
Publication:2904746
DOI10.4230/LIPIcs.STACS.2012.30zbMath1245.68251MaRDI QIDQ2904746
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Constant Factor Approximation for ATSP with Two Edge Weights ⋮ Approximation hardness of graphic TSP on cubic graphs ⋮ A deterministic better-than-3/2 approximation algorithm for metric TSP ⋮ An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem ⋮ The traveling salesman problem on cubic and subcubic graphs ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ New inapproximability bounds for TSP ⋮ \(\frac{13}{9}\)-approximation for graphic TSP ⋮ TSP Tours in Cubic Graphs: Beyond 4/3 ⋮ Constant factor approximation for ATSP with two edge weights ⋮ Unnamed Item ⋮ Approximating minimum-cost connected \(T\)-joins
This page was built for publication:
