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

DOI10.1007/978-3-030-17402-6_6OpenAlexW2893228190MaRDI QIDQ2294041FDOQ2294041

Authors: René van Bevern, Philipp Zschoche, O. Yu. Tsidulko 

Publication date: 6 February 2020

Full work available at URL: https://arxiv.org/abs/1806.11527

Recommendations

• Representative families for matroid intersections, with applications to location, packing, and covering problems
• Improved approximation algorithms for matroid and knapsack median problems and applications
• Improved approximation algorithms for matroid and knapsack median problems and applications
• Facility Location with Matroid or Knapsack Constraints
• A parameterized view on matroid optimization problems

zbMATH Keywords

social network analysismatroid paritystrong triadic closurematroid medianmatroid set packingrepresentative families

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (9)

• Facility Location with Matroid or Knapsack Constraints
• On the Parameterized Complexity of the Expected Coverage Problem
• On the parameterized complexity of the expected coverage problem
• Representative families for matroid intersections, with applications to location, packing, and covering problems
• Parameterized complexity of conflict-free set cover
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
• Your rugby mates don't need to know your colleagues: triadic closure with edge colors
• Polynomial-time data reduction for weighted problems beyond additive goal functions
• Title not available (Why is that?)

This page was built for publication: Fixed-parameter algorithms for maximum-profit facility location under matroid constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294041)