2000 character limit reached
Representative families for matroid intersections, with applications to location, packing, and covering problems (1806.11527v4)
Published 29 Jun 2018 in cs.DS, cs.DM, and math.OC
Abstract: We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our tractability results by hardness results.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.