Treffer: An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

Title:
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Authors:
Chekuri, C., Pal, M.
Source:
LECTURE NOTES IN COMPUTER SCIENCE. (4110):95-103
Availability:
http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN061219510&indx=1&recIds=ETOCCN061219510
Database:
British Library Document Supply Centre Inside Serials & Conference Proceedings