Conference Program


 (Add to Calendar)  Thursday, August 23, 17:00 – 17:50 h, H0105:

Amin Saberi: Rounding by Sampling and Traveling Salesman Problems

Chair: Friedrich Eisenbrand



I will talk about a new technique for rounding the solution of linear programming relaxations of combinatorial optimization problems. In particular, I will present new algorithms for symmetric and asymmetric traveling salesman problems, improving the best known approximation ratios for these problems.


Biographical sketch:

Amin Saberi is an Associate Professor and 3COM faculty scholar in Stanford University. He received his B.Sc. from Sharif University of Technology and his Ph.D. from Georgia Institute of Technology in Computer Science. His research interests include algorithms, approximation algorithms, and algorithmic aspects of games, markets, and networks. He is a Frederick Terman Fellow (2005-2010), an Alfred Sloan Fellow (2010-2012), and the recipient of National Science Foundation Career award as well as best paper awards in FOCS 2011 and SODA 2010.

  Today, Payday Loans Ohio are legitimate, but there are illegal transactions that are still on the rise. Cialis Professional online is capableto release you reliably from the erection problems, its improved formula gives the new properties to the drug.