A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
We regard the problem of generating randomized roundings with a single cardinality constraint. This is motivated by recent results of Srinivasan (FOCS 2001), Gandhi et al. (FOCS 2002, J.ACM 2006 and the first author (STACS 2005, STACS 2006). Our work results in (a) an improved version of the bitwise derandomization given by the first author, (b) the first derandomization of Srinivasan's treebased randomized approach, together with a proof of its correctness, and (c) an experimental comparisondoi:10.1145/2594409 fatcat:d6zlzyaglrfwzgwnwu3ad5ovc4