Name
Title | ||
|---|---|---|
Representative Families For Matroid Intersections, With Applications To Location, Packing, And Covering Problems |
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. (C) 2021 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.dam.2021.03.014 | DISCRETE APPLIED MATHEMATICS |
Keywords | DocType | Volume |
Combinatorial optimization, Matroid set packing, Matroid parity, Matroid median | Journal | 298 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| René van Bevern | 1 | 126 | 19.33 |
| O. Yu. Tsidulko | 2 | 1 | 2.85 |
| Philipp Zschoche | 3 | 5 | 2.15 |