| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649472 | Discrete Mathematics | 2009 | 6 Pages |
Abstract
We consider a problem related to the submodular set cover on polymatroids, when the ground set is the family of independent sets of a matroid. The achievement here is getting a strongly polynomial running time with respect to the ground set of the matroid even though the family of independent sets has exponential size. We also address the optimization problem of the maximization of submodular set functions on the independent sets of a matroid.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Luisa Gargano, Mikael Hammar,