title:
Rounding By Sampling Method and the Traveling Salesman Problem.

Abstract: 
Rounding by Sampling method is an emerging idea in the fields of combinatorial optimization and approximation algorithms. It is a new randomized rounding method that rounds the fractional solution of the linear programming relaxation by sampling from a particular marginal preserving distribution on the integer points. 
Recently, this technique has been applied quite successfully to various problems including different variants of the traveling salesman problem, max-min fair allocation, online stochastic matching, .

In this talk I will describe the application of this method to the traveling salesman problem.