# On a generalization of iterated and randomized rounding

arXiv: https://arxiv.org/abs/1811.01597 · HTML: https://mlsanity.com/paper/1811.01597/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Nov 2018.

## Built on by (most cited first, 1 of 1)

- [The risk of KV cache compression](https://mlsanity.com/paper/2607.01520/) (2026)

## Abstract (arXiv)

We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack, there is a randomized procedure that returns an integral solution that satisfies the guarantees of iterated rounding and also has concentration properties. We use this to give new results for several classic problems where iterated rounding has been useful.