Applications Can handle matroid constraint plus packing constraints x  P(M) and Ax ≤ b (1-1/e) approximation for submodular functions subject to a matroid plus O(1) knapsack/packing constraints (or many loose packing constraints) Simpler rounding and proof for thin spanning trees in ATSP application ([Asadpour etal'10])...
{}