A new approximation algorithm for the asymmetric TSP with triangle inequality

DOI10.1145/1383369.1383378zbMath1445.68345OpenAlexW2056179869MaRDI QIDQ4962752

Markus Bläser

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1383369.1383378

zbMATH Keywords

TSPapproximation algorithmtraveling salesman problemcycle cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Lower and upper competitive bounds for online directed graph exploration ⋮ Polyhedral techniques in combinatorial optimization: matchings and tours

This page was built for publication: A new approximation algorithm for the asymmetric TSP with triangle inequality