Algorithmics and Computational Complexity Research GroupTalk 31.01.2019

Fixed-parameter algorithms for maximum-profit facility location under matroid constraints

Philipp Zschoche (TU Berlin)

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.

Date
Speaker
Location
Language
31.01.2019
16:15
Philipp Zschoche
TEL 512
English

Back to the research colloquium site.

Nach oben