Approximating bounded 0-1 integer linear programs

This publication has 14 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• Optimization, approximation, and complexity classes
  Journal of Computer and System Sciences, 1991
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
  Combinatorica, 1987
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983
• On the Fractional Solution to the Set Covering Problem
  SIAM Journal on Algebraic Discrete Methods, 1983
• An analysis of the greedy algorithm for the submodular set covering problem
  Combinatorica, 1982
• Vertex packings: Structural properties and algorithms
  Mathematical Programming, 1975
• On the ratio of optimal integral and fractional covers
  Discrete Mathematics, 1975
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
  The Annals of Mathematical Statistics, 1952