In this dissertation, we study four problems in combinatorial and stochastic optimization. The
first two chapters give improved approximation algorithms for classic combinatorial …

In this talk, I will overview progress in our probabilistic understanding of the (shadow vertex)
simplex method in three different settings: smoothed polytopes (whose data is randomly …