Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph coloring, in scheduling and in statistics. Here, it often is also desirable to round each entry randomly such that the probability of rounding it up equals its fractional part. This is known as unbiased rounding in statistics and as randomized rounding in computer science.

We show how to compute such an unbiased rounding of an m ×n matrix in expected time O(mnq 2), where q is the common denominator of the matrix entries. We also show that if the denominator can be written as \(q=\Pi_{i=1}^{\ell} q_{i}\) for some integers q i , the expected runtime can be reduced to \(O(mn \sum_{i=1}^{\ell} q_{i}^{2})\). Our algorithm can be derandomised efficiently using the method of conditional probabilities.

Our roundings have the additional property that the errors in all initial intervals of rows and columns are less than one.


Rational Matrice Matrix Entry Current Matrix Index Interval Neighboring Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bacharach, M.: Matrix rounding problems. Management Science (Ser. A) 12, 732–742 (1966)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Baranyai, Z.: On the factorization of the complete uniform hypergraph. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), vol. I. Colloq. Math. Soc. Jánōs Bolyai, vol. 10, pp. 91–108. North-Holland, Amsterdam (1975)Google Scholar
  3. 3.
    Causey, B.D., Cox, L.H., Ernst, L.R.: Applications of transportation theory to statistical problems. Journal of the American Statistical Association 80, 903–909 (1985)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Cox, L.H.: A constructive procedure for unbiased controlled rounding. Journal of the American Statistical Association 82, 520–524 (1987)MATHCrossRefGoogle Scholar
  5. 5.
    Cox, L.H., Ernst, L.R.: Controlled rounding. Informes 20, 423–432 (1982)MATHGoogle Scholar
  6. 6.
    Doerr, B.: Generating randomized roundings with cardinality constraints and derandomizations. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 571–583. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Doerr, B., Friedrich, T., Klein, C., Osbild, R.: Unbiased matrix rounding. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 102–112. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Fellegi, I.P.: Controlled random rounding. Survey Methodology 1, 123–133 (1975)Google Scholar
  9. 9.
    Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci. 37, 130–143 (1988)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Šíma, J.: Table rounding problem. Computers and Artificial Intelligence 18, 175–189 (1999)MATHMathSciNetGoogle Scholar
  11. 11.
    Spencer, J.: Randomization, derandomization and antirandomization: Three games. Theoretical Computer Science 131, 415–429 (1994)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Willenborg, L., de Waal, T.: Elements of Statistical Disclosure Control. Lecture Notes in Statistics, vol. 155. Springer, Heidelberg (2001)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Benjamin Doerr
    • 1
  • Christian Klein
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations