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 optimization problems can be decomposed into polynomially many subproblems, which in turn can often be solved in polynomial time .