##
###
Approximability of Sparse Integer Programs

David Pritchard, Deeparnab Chakrabarty

2010
*
Algorithmica
*

Second, for *packing* integer programs {max cx : Ax ≤ b, 0 ≤ x ≤ d} where A has at most k nonzeroes per *column*, we give a (2k 2 + 2)-*approximation* *algorithm*. ...
In addition, we obtain improved *approximations* for the second *problem* when k = 2, and for both *problems* when every A ij is small compared *to* b i . ...
Acknowledgement We would like *to* thank Glencora Borradaile, Christina Boucher, Stephane Durocher, Jochen Könemann and Christos Koufogiannakis for helpful discussions, and the ESA and Algorithmica referees ...

doi:10.1007/s00453-010-9431-z
fatcat:h4te5eiug5cdvnhr5asr66uyby