Representative families for matroid intersections, with applications to location, packing, and covering problems
Data Structures and Algorithms
2021-09-14 v4 Discrete Mathematics
Optimization and Control
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.
Cite
@article{arxiv.1806.11527,
title = {Representative families for matroid intersections, with applications to location, packing, and covering problems},
author = {René van Bevern and Oxana Yu. Tsidulko and Philipp Zschoche},
journal= {arXiv preprint arXiv:1806.11527},
year = {2021}
}
Comments
Restructuring (focus on representative families instead of facility location), slight running time improvements, algorithms factored out