Randomized Rounding: A Technique for Provably Good Algorithms and

  • Authors:

  • Prabhakar Raghavan;Clark D. Thompson

  • Affiliations:

  • -;-

  • Venue:
  • Randomized Rounding: A Technique for Provably Good Algorithms and
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the relation between a class of 0-1 integer linear programs and their rational relaxations. We show that the rational optimum to a problem instance can be used to construct a provably good 0-1 solution by means of a randomized algorithm. Our technique can be extended to provide bounds on the disparity between the rational and 0-1 optima for a given problem instance.