Cookies?
Library Header Image
LSE Research Online LSE Library Services

Approximate multi-matroid intersection via iterative refinement

Linhares, Andre, Olver, Neil, Swamy, Chaitanya and Zenklusen, Rico (2019) Approximate multi-matroid intersection via iterative refinement. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),11480. Springer, USA, 299 - 312. ISBN 9783030179526

Full text not available from this repository.

Identification Number: 10.1007/978-3-030-17953-3_23

Abstract

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 other ones. On top of the classical steps of iterative relaxation approaches, we iteratively refine/split involved matroid constraints to obtain a more restrictive constraint system, that is amenable to iterative relaxation techniques. 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/rounding methods, which typically round on one matroid polytope with additional simple cardinality constraints that do not overlap too much. We show how 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.

Item Type: Book Section
Official URL: https://link.springer.com/conference/ipco
Additional Information: © 2019 Springer Nature Switzerland AG
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 23 Jan 2020 16:54
Last Modified: 20 Nov 2020 02:58
URI: http://eprints.lse.ac.uk/id/eprint/103165

Actions (login required)

View Item View Item