A note on submodular set cover on matroids

被引：5

作者：

Gargano, Luisa ^{[1
]}

Hammar, Mikael ^{[2
]}

机构：

[1] Univ Salerno, Dipartimento Informat & Applicaz, I-84084 Fisciano, SA, Italy

[2] Apptus Technol AB, Res & Dev, S-22370 Lund, Sweden

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 18期

关键词：

Matroid; Independent sets; Set cover; ALGORITHM;

D O I：

10.1016/j.disc.2008.05.019

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：5739 / 5744

页数：6

共 50 条

[41] Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
Majun Shi
Zishen Yang
Wei Wang
[J]. Journal of Combinatorial Optimization, 2023, 45
[42] Simple push-relabel algorithms for matroids and submodular flows
András Frank
Zoltán Miklós
[J]. Japan Journal of Industrial and Applied Mathematics, 2012, 29 : 419 - 439
[43] Simple push-relabel algorithms for matroids and submodular flows
Frank, Andras
Miklos, Zoltan
[J]. JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2012, 29 (03) : 419 - 439
[44] Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
Jian Sun
Haiyun Sheng
Yuefang Sun
Donglei Du
Xiaoyan Zhang
[J]. Journal of Combinatorial Optimization, 2022, 44 : 2626 - 2641
[45] Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
Sun, Jian
Sheng, Haiyun
Sun, Yuefang
Du, Donglei
Zhang, Xiaoyan
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 2626 - 2641
[46] A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities
Pham, Canh, V
Ha, Dung T. K.
[J]. INFORMATION PROCESSING LETTERS, 2023, 182
[47] A note on minimizing submodular functions
Nagamochi, H
Ibaraki, T
[J]. INFORMATION PROCESSING LETTERS, 1998, 67 (05) : 239 - 244
[48] Generalized submodular cover problems and applications
Bar-Ilan, J
Kortsarz, G
Peleg, D
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 250 (1-2) : 179 - 200
[49] Submodular Function Minimization under a Submodular Set Covering Constraint
Kamiyama, Naoyuki
[J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 133 - 141
[50] Minimum Cost Adaptive Submodular Cover
Cui, Yubing
Nagarajant, Viswanath
[J]. 2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 12 - 27

← 1 2 3 4 5 →