Reviews: Faster width-dependent algorithm for mixed packing and covering LPs

This paper shows that Mixed Packing Covering Linear programs can be eps-approximated in O(1/eps) iterations. This work builds on Sherman's approach to max flow. This is a strong result on an important class of problems. Optimization problems of this nature arise frequently in machine learning applications and reducing the eps dependence from quadratic to linear is a significant improvement. The reviewers liked the result and the presentation and strongly supported acceptance.