The Entropy Rounding Method in Approximation Algorithms

@inproceedings{Rothvo2012TheER,
  title={The Entropy Rounding Method in Approximation Algorithms},
  author={Thomas Rothvo\ss},
  booktitle={SODA},
  year={2012}
}
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in particular) is to obtain an integral vector y such that Ax ≈ Ay and c y exceeds cx by only a moderate factor. We give a new randomized rounding procedure for this task, provided that A has bounded ∆-approximate entropy. This property means that for uniformly chosen… CONTINUE READING
9 Citations
46 References
Similar Papers

Similar Papers

Loading similar papers…