Approximate multi-matroid intersection via iterative refinement
Mathematical Programming , Volume 183 - Issue 1-2 p. 397- 418
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the constraints of the other matroids. In addition to the classical steps of iterative relaxation approaches, we iteratively refine involved matroid constraints. This leads to more restrictive constraint systems whose structure can be exploited to prove the existence of constraints that can be dropped. Hence, throughout the iterations, we both tighten constraints and later relax them by dropping constraints under certain conditions. Due to the refinement step, we can deal with considerably more general constraint classes than existing iterative relaxation and rounding methods, which typically involve a single matroid polytope with additional simple cardinality constraints that do not overlap too much. We show that our rounding method, combined with an application of a matroid intersection algorithm, yields the first 2-approximation for finding a maximum-weight common independent set in 3 matroids. Moreover, our 2-approximation is LP-based and settles the integrality gap for the natural relaxation of the problem. Prior to our work, no upper bound better than 3 was known for the integrality gap, which followed from the greedy algorithm. We also discuss various other applications of our techniques, including an extension that allows us to handle a mixture of matroid and knapsack constraints.
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Linhares, A, Olver, N.K, Swamy, C, & Zenklusen, R. (2020). Approximate multi-matroid intersection via iterative refinement. Mathematical Programming, 183(1-2), 397–418. doi:10.1007/s10107-020-01524-y