Rounding By Sampling
۲۵ مرداد · Classes

In this talk Arash Asadpour, a Ph.D Student of operations research at Stanford University, presented a general framework for rounding in discrete optimization problems; the most significant of which are the Traveling Salesman Problem (TSP) , Resource Allocation Problems, and Fair Allocation.

Number of Participants: 28

Download brochure