Probabilistic construction of deterministic algorithms: Approximating packing integer programs


We consider the problem of approximating an integer program by first solving its relaxation linear program and "rounding" the resulting solution. For several packing problems, we prove probabilistically that there exists an integer solution close to the optimum of the relaxation solution. We then develop a methodology for converting such a probabilistic… (More)
DOI: 10.1109/SFCS.1986.45


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics