Back to Search
Start Over
A constrained two-stage submodular maximization.
- Source :
-
Theoretical Computer Science . Jan2021, Vol. 853, p57-64. 8p. - Publication Year :
- 2021
-
Abstract
- In this paper, we investigate the two-stage submodular maximization problem, where there is a collection F = { f 1 ,... , f m } of m submodular functions which are defined on the same element ground set Ω. The goal is to select a subset S ⊆ Ω of size at most ℓ such that 1 m ∑ f ∈ F max T ⊆ S , T ∈ I f (T) is maximized, where I denotes a specifically-defined independence system. We consider the two-stage submodular maximization with a P -matroid constraint and present a (1 / (P + 1)) (1 − 1 / e (P + 1)) -approximation algorithm. Furthermore, we extend the algorithm to the two-stage submodular maximization with a more generalized P -exchange system constraint and show the approximation ratio can be maintained with slightly modifications of the algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 853
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 147929267
- Full Text :
- https://doi.org/10.1016/j.tcs.2020.05.024