Unbiased rounding of rational matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4337 LNCS, Issue , 2006, Pages 200-211

  Doerr, Benjamin ^a   Klein, Christian ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

CLASSICAL PROBLEMS; COMMON DENOMINATORS; CONDITIONAL PROBABILITIES; FRACTIONAL PARTS; HYPERGRAPH COLORING; RANDOMIZED ROUNDING; RATIONAL MATRICES; ROUNDING ERRORS;

MATRIX ALGEBRA;

EID: 38049109562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_20     Document Type: Conference Paper

References (12)

1. M. Bacharach. Matrix rounding problems. Management Science (Ser. A), 12:732–742, 1966.
2. Zs. Baranyai. 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, pages 91–108. Colloq. Math. Soc. Jánōs Bolyai, Vol. 10. North-Holland, Amsterdam, 1975.
3. B. D. Causey, L. H. Cox, and L. R. Ernst. Applications of transportation theory to statistical problems. Journal of the American Statistical Association, 80:903–909, 1985.
4. L. H. Cox. A constructive procedure for unbiased controlled rounding. Journal of the American Statistical Association, 82:520–524, 1987.
5. L. H. Cox and L. R. Ernst. Controlled rounding. Informes, 20:423–432, 1982.
6. B. Doerr. Generating randomized roundings with cardinality constraints and derandomizations. In 23rd Annual Symposium on Theoretical Aspects of Computer Science, volume 3884 of Lecture Notes in Computer Science, pages 571–583, Marseille, France, 2006. Springer.
7. B. Doerr, T. Friedrich, C. Klein, and R. Osbild. Unbiased matrix rounding. In 10th Scandinavian Workshop on Algorithm Theory, volume 4059 of Lecture Notes in Computer Science, pages 102–112, Riga, Latvia, 2006. Springer.
8. I. P. Fellegi. Controlled random rounding. Survey Methodology, 1:123–133, 1975.
9. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130–143, 1988.
10. J. Šíma. Table rounding problem. Computers and Artificial Intelligence, 18:175–189, 1999.
11. J. Spencer. Randomization, derandomization and antirandomization: Three games. Theoretical Computer Science, 131:415–429, 1994.
12. L. Willenborg and T. de Waal. Elements of Statistical Disclosure Control, volume 155 of Lecture Notes in Statistics. Springer, 2001.