Fixed-parameter algorithms for maximum-profit facility location under matroid constraints. (English) Zbl 07163776

van Bevern, René; Tsidulko, Oxana Yu.; Zschoche, Philipp

Heggernes, Pinar (ed.), Algorithms and complexity. 11th international conference, CIAC 2019, Rome, Italy, May 27–29, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-17401-9/pbk; 978-3-030-17402-6/ebook). Lecture Notes in Computer Science 11485, 62-74 (2019).

Summary: 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.
For the entire collection see [Zbl 1412.68010].

MSC:

68Wxx

Algorithms in computer science

Keywords:

matroid set packing; matroid parity; matroid median; representative families; social network analysis; strong triadic closure