Representative families for matroid intersections, with applications to location, packing, and covering problems. van Bevern, R., Tsidulko, O., & Zschoche, P. Discrete Applied Mathematics, 298:110-128, 2021.
Representative families for matroid intersections, with applications to location, packing, and covering problems [link]Preprint  Representative families for matroid intersections, with applications to location, packing, and covering problems [link]Slides  doi  abstract   bibtex   7 downloads  
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.
@article{BTZ21,
  author =	 {Ren{\'{e}} van Bevern and Oxana Tsidulko and Philipp
                  Zschoche},
  title =	 {Representative families for matroid intersections,
                  with applications to location, packing, and covering
                  problems},
  year =	 {2021},
  journal =	 {Discrete Applied Mathematics},
  volume =	 {298},
  pages =	 {110-128},
  date =	 {2021-03-22},
  url_Preprint = {https://arxiv.org/abs/1806.11527},
  doi =		 {10.1016/j.dam.2021.03.014},
  url_Slides =
                  {https://figshare.com/articles/presentation/Facility_location_under_matroid_constraints_fixed-parameter_algorithms_and_applications/13536788},
  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. },
}

Downloads: 7