Non-independent randomized rounding and an application to digital halftoning

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

Volumn 2461, Issue , 2002, Pages 399-409

  Doerr, Benjamin ^a   Schnieder, Henning ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Digital halftoning; Discrepancy; Randomized rounding

Indexed keywords

ERRORS;

DETERMINISTIC ALGORITHMS; DIGITAL HALFTONING; DISCREPANCY; ERROR DIFFUSION; RANDOMIZED ALGORITHMS; RANDOMIZED ROUNDING; ROUNDING ERRORS; ROUNDING SCHEMES;

MATRIX ALGEBRA;

EID: 84938075150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_37     Document Type: Conference Paper

References (13)

1. N. A1on, B. Doerr, T. 1uczak, and T. Schoen. On the discrepancy of combinatoria1 rectang1es. Tentative1y accepted for pub1ication in Random Structures & A1gorithms, 2001. 402
2. T. Asano, N. Katoh, K. Obokata, and T. Tokuyama. Matrix rounding under the 1p-discrepancy measure and its app1ication to digita1 ha1ftoning. In Proceedings of the 13th Annua1 ACM-SIAM Symposium on Discrete A1gorithms, 2002. 400, 401, 406
3. B. E. Bayer. An optimum method for two-1eve1 rendition of continous-tone pictures. In Conference Record, IEEE Internationa1 Conference on Communications, vo1ume 1, pages (26-11)-(26-15). IEEE, 1973. 400
4. D. Bertsimas, C. Teo, and R. Vohra. On dependent randomized rounding a1gorithms. Oper. Res. 1ett., 24:105-114, 1999. 402
5. B. Doerr. 1attice approximation and 1inear discrepancy of tota11y unimodu1ar matrices. In Proceedings of the 12th Annua1 ACM-SIAM Symposium on Discrete A1gorithms, pages 119-125, 2001. 399
6. B. Doerr. Structured randomized rounding and co1oring. In R. Freiva1ds, editor, Fundamenta1s of Computation Theory, vo1ume 2138 of 1ecture Notes in Computer Science, pages 461-471, Ber1in-Heide1berg, 2001. Springer Ver1ag. 402
7. R. W. F1oyd and 1. Steinberg. An adaptive a1gorithm for spatia1 grey sca1e. In SID 75 Digest, pages 36-37. Society for Information Disp1ay, 1975. 400
8. D. E. Knuth. Digita1 ha1ftones by dot diffusion. ACM Trans. Graphics, 6:245-273, 1987. 400
9. D.E. Knuth. Two-way rounding. SIAM J. Discrete Math., 8:281-290, 1995. 399
10. B. 1ippe1 and M. Kur1and. The effect of dither on 1uminance quantization of pictures. In IEEE Trans. Commun. Tech. COM-19, pages 879-888, 1971. 400
11. P. Raghavan. Probabi1istic construction of deterministic a1gorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130-143, 1988. 402
12. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for prov-ab1y good a1gorithms and a1gorithmic proofs. Combinatorica, 7(4):365-374, 1987. 402
13. A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29:648-670, 1999. 402