Microsoft Research
Microsoft Translator |
A Constant Approximation Algorithm for the a priori Traveling Salesman Problem

David B. Shmoys and Kunal Talwar
May 2008

apriori-constant-lncs.pdf
PDF file

In  International Conference Integer Programming and Combinatorial Optimization (IPCO)

Publisher  Springer Verlag
All copyrights reserved by Springer 2007.

Details

TypeInproceedings
URLhttp://dx.doi.org/10.1007/978-3-540-68891-4_23
Pages331-343
Volume5035
SeriesLecture Notes in Computer Science
ISBN978-3-540-68886-0
AddressBertinoro, Italy
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > A Constant Approximation Algorithm for the a priori Traveling Salesman Problem