A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Non-independent Randomized Rounding and an Application to Digital Halftoning
[chapter]

2002
*
Lecture Notes in Computer Science
*

We investigate the problem to round a given [0, 1]-valued matrix to a 0, 1 matrix such that the rounding error with respect to 2 × 2 boxes is small. Such roundings yield good solutions for the digital halftoning problem as shown by Asano et al. (SODA 2002). We present a randomized algorithm computing roundings with expected error at most 0.6287 per box, improving the 0.75 non-constructive bound of Asano et al. Our algorithm is the first one solving this problem fast enough for practical

doi:10.1007/3-540-45749-6_37
fatcat:ffhfd6r5tvdnbdvxq6nyhw76ey