Before revision:  In the former, we show that a wide range of robust combinatorial  problems can be decomposed into polynomially many subproblems, which in turn can often be solved in polynomial time  .
After revision:  In the former, we show that a wide range of robust combinatorial problems can be decomposed into polynomially many subproblems, which in turn can often be solved in polynomial time for example in the case of (representative) selection .