We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular our roundings are not independent.We show that such non-independent randomized roundings exist if and only if the hypergraph corresponding to these dependencies is totally unimodular.
展开▼
