Algorithms to Approximate Column-Sparse Packing Problems
release_klg4n3mbyvgibkcki45i4rcdne
by
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan
Xu
2019
Abstract
Column-sparse packing problems arise in several contexts in both
deterministic and stochastic discrete optimization. We present two unifying
ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain
improved approximation algorithms for some well-known families of such
problems. As three main examples, we attain the integrality gap, up to
lower-order terms, for known LP relaxations for k-column sparse packing integer
programs (Bansal et al., Theory of Computing, 2012) and stochastic k-set
packing (Bansal et al., Algorithmica, 2012), and go "half the remaining
distance" to optimal for a major integrality-gap conjecture of Furedi, Kahn and
Seymour on hypergraph matching (Combinatorica, 1993).
In text/plain
format
Archived Files and Locations
application/pdf 451.1 kB
file_o3pk744jovgotkrbkd4wiaxkvq
|
arxiv.org (repository) web.archive.org (webarchive) |
1711.02724v5
access all versions, variants, and formats of this works (eg, pre-prints)