{"_id":"kkBSkbvjwnfRybsaa","bibbaseid":"vanbevern-tsidulko-zschoche-representativefamiliesformatroidintersectionswithapplicationstolocationpackingandcoveringproblems-2021","authorIDs":["2fwXJtKDCNhaSNr5s"],"author_short":["van Bevern, R.","Tsidulko, O.","Zschoche, P."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["René"],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]},{"firstnames":["Oxana"],"propositions":[],"lastnames":["Tsidulko"],"suffixes":[]},{"firstnames":["Philipp"],"propositions":[],"lastnames":["Zschoche"],"suffixes":[]}],"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. ","bibtex":"@article{BTZ21,\n author =\t {Ren{\\'{e}} van Bevern and Oxana Tsidulko and Philipp\n Zschoche},\n title =\t {Representative families for matroid intersections,\n with applications to location, packing, and covering\n problems},\n year =\t {2021},\n journal =\t {Discrete Applied Mathematics},\n volume =\t {298},\n pages =\t {110-128},\n date =\t {2021-03-22},\n url_Preprint = {https://arxiv.org/abs/1806.11527},\n doi =\t\t {10.1016/j.dam.2021.03.014},\n url_Slides =\n {https://figshare.com/articles/presentation/Facility_location_under_matroid_constraints_fixed-parameter_algorithms_and_applications/13536788},\n abstract =\t {We show algorithms for computing representative\n families for matroid intersections and use them in\n fixed-parameter algorithms for set packing, set\n covering, and facility location problems with\n multiple matroid constraints. We complement our\n tractability results by hardness results. },\n}\n\n","author_short":["van Bevern, R.","Tsidulko, O.","Zschoche, P."],"key":"BTZ21","id":"BTZ21","bibbaseid":"vanbevern-tsidulko-zschoche-representativefamiliesformatroidintersectionswithapplicationstolocationpackingandcoveringproblems-2021","role":"author","urls":{" preprint":"https://arxiv.org/abs/1806.11527"," slides":"https://figshare.com/articles/presentation/Facility_location_under_matroid_constraints_fixed-parameter_algorithms_and_applications/13536788"},"metadata":{"authorlinks":{"van bevern, r":"https://rvb.su/"}},"downloads":7,"html":""},"bibtype":"article","biburl":"http://rvb.su/rvb.bib","creationDate":"2021-03-23T06:32:53.144Z","downloads":7,"keywords":[],"search_terms":["representative","families","matroid","intersections","applications","location","packing","covering","problems","van bevern","tsidulko","zschoche"],"title":"Representative families for matroid intersections, with applications to location, packing, and covering problems","year":2021,"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}