@article{046a3e6c8e9745fa94e808a8df509a95,
title = "Representative families for matroid intersections, with applications to location, packing, and covering problems",
abstract = "We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our tractability results by hardness results.",
keywords = "Combinatorial optimization, Matroid median, Matroid parity, Matroid set packing",
author = "{van Bevern}, Ren{\'e} and Tsidulko, {Oxana Yu} and Philipp Zschoche",
note = "Funding Information: Ren{\'e} van Bevern was supported by Russian Foundation for Basic Research (RFBR) grant 18-501-12031 NNIO_a . Oxana Yu. Tsidulko was supported by RFBR grant 18-31-00470 mol_a . Publisher Copyright: {\textcopyright} 2021 Elsevier B.V. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.",
year = "2021",
month = jul,
day = "31",
doi = "10.1016/j.dam.2021.03.014",
language = "English",
volume = "298",
pages = "110--128",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
}