link

November 27, Sunday
12:00 – 14:00

TSPs, Cycle Covers and Approximations in Directed Graphs
Computer Science seminar
Lecturer : Dr. Moshe Lewenstein
Lecturer homepage : http://www.cs.biu.ac.il/~moshe/
Affiliation : CS Department , Bar Ilan University
Location : -101/58
Host : Dr. Michael Elkin
TSPs have been intensively researched in undirected graphs. A bit less known is the research for TSPs in directed graphs, although also here quite a bit of research has been done. We will consider the classical minimum variant and also the maximum variant which is also known as the "taxicab ripoff problem".

joint work with: Haim Kaplan, Nira Shafrir and Maxim Sviridenko