An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

DOI10.1007/11830924_11zbMath1155.90465OpenAlexW2146713665MaRDI QIDQ3595398

Chandra Chekuri, Martin Pál

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_11

Mathematics Subject Classification ID

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

Related Items (1)

The on-line asymmetric traveling salesman problem

This page was built for publication: An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem