We show how to round [0,1]^{m x n}-matrices such that all errors in initial row and column intervals (i.e., x_{i1},...,x_{ia} for a<=n) are smaller than one. We also give a randomized algorithm that rounds each entry to 1 with probability equal to its value.
Joint work with Benjamin Doerr, Tobias Friedrich and Ralf Osbild.