Two-stage non-submodular maximization
From MaRDI portal
Publication:6132970
DOI10.1016/j.tcs.2023.114017MaRDI QIDQ6132970
Xiaoyan Zhang, Ping Li, Jing Jin, Zhi-cheng Liu, Hong Chang
Publication date: 21 July 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- New performance guarantees for the greedy maximization of submodular set functions
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Maximize a monotone function with a generic submodularity ratio
- A constrained two-stage submodular maximization
- Approximating the least core value and least core of cooperative games with supermodular costs
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- An analysis of approximations for maximizing submodular set functions—I