Scientific Program

Semi-plenary Lecture

Program -> Plenary and Semi-Plenary -> Thu.17:00.H 0105 title only | abstract | bio sketch

Thursday, 17:00 - 17:50 h, H 0105


Amin Saberi
Rounding by Sampling and Traveling Salesman Problems


Chair: Friedrich Eisenbrand


Abstract:
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.

 

 

Program -> Plenary and Semi-Plenary -> Thu.17:00.H 0105 title only | abstract | bio sketch

  In particular, Payday Loans Texas can cater to the needs of its residents. Therefore, we can say that the active substances in its composition are more perfectly mixed. Vardenafil is not only present in the original Levitra Online, but also as part of its analogs.