@inproceedings{514b1dbb68f741ed91e6c54f761639cb,
title = "Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints",
abstract = "We consider an uncapacitated discrete facility location problem where the task is to decide which facilities to open and which clients to serve for maximum profit so that the facilities form an independent set in given facility-side matroids and the clients form an independent set in given client-side matroids. We show that the problem is fixed-parameter tractable parameterized by the number of matroids and the minimum rank among the client-side matroids. To this end, we derive fixed-parameter algorithms for computing representative families for matroid intersections and maximum-weight set packings with multiple matroid constraints. To illustrate the modeling capabilities of the new problem, we use it to obtain algorithms for a problem in social network analysis. We complement our tractability results by lower bounds.",
keywords = "Matroid median, Matroid parity, Matroid set packing, Representative families, Social network analysis, Strong triadic closure",
author = "{van Bevern}, Ren{\'e} and Tsidulko, {Oxana Yu} and Philipp Zschoche",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-17402-6_6",
language = "English",
isbn = "9783030174019",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "62--74",
editor = "Pinar Heggernes",
booktitle = "Algorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings",
address = "Germany",
note = "11th International Conference on Algorithms and Complexity, CIAC 2019 ; Conference date: 27-05-2019 Through 29-05-2019",
}