@article {17606,
	title = {Improved Approximation Guarantees for Packing and Covering Integer Programs},
	journal = {SIAM Journal on Computing},
	volume = {29},
	year = {1999},
	month = {1999///},
	pages = {648 - 648},
	abstract = {Several important NP-hard combinatorial optimization problems can be posed as packing/covering integer programs; the randomized rounding technique of Raghavan and Thompson is a powerful tool with which to approximate them well. We present one elementary unifying property of all these integer linear programs and use the FKG correlation inequality to derive an improved analysis of randomized rounding on them. This yields a pessimistic estimator, thus presenting deterministic polynomial-time algorithms for them with approximation guarantees that are significantly better than those known.},
	isbn = {00975397},
	doi = {10.1137/S0097539796314240},
	url = {http://link.aip.org/link/SMJCAT/v29/i2/p648/s1\&Agg=doi},
	author = {Srinivasan, Aravind}
}
