Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
From MaRDI portal
Publication:2294041
DOI10.1007/978-3-030-17402-6_6OpenAlexW2893228190MaRDI QIDQ2294041
René van Bevern, Philipp Zschoche, O. Yu. Tsidulko
Publication date: 6 February 2020
Full work available at URL: https://arxiv.org/abs/1806.11527
matroid paritysocial network analysisstrong triadic closurematroid medianmatroid set packingrepresentative families
Related Items (8)
On the Parameterized Complexity of the Expected Coverage Problem ⋮ On the parameterized complexity of the expected coverage problem ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Polynomial-time data reduction for weighted problems beyond additive goal functions ⋮ On the relation of strong triadic closure and cluster deletion ⋮ Representative families for matroid intersections, with applications to location, packing, and covering problems ⋮ Your rugby mates don't need to know your colleagues: triadic closure with edge colors ⋮ Parameterized complexity of conflict-free set cover
This page was built for publication: Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
