Title: A report on TSP with release times

Speaker: Wei Yu, Zhejiang Univ.

Time/Date:  Monday, Mar 19, 3-4p
Location: Room 3464

Abstract: We consider a generalization of the well-known Traveling Salesman Problem in which
each city has a release time and the salesman can not visit any city before its
release time. We give the first non-trivial approximation algorithms for this problem
with a fixed number of release times. Moreover, we apply the algorithms to some more general
problems.