The following publications are possibly variants of this publication:
- Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack ConstraintJing Tang, Xueyan Tang, Andrew Lim, Kai Han 0003, Chongshou Li, Junsong Yuan. sigmetrics 2021: 63-64 [doi]
- Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton AlgorithmJingwen Chen, Zhongzheng Tang, Chenhao Wang 0001. AAIM 2022: 144-155 [doi]
- Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack ConstraintDung K. T. Ha 0001, Canh V. Pham, Tan D. Tran, Huan X. Hoang. kse 2023: 1-6 [doi]
- Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack ConstraintCanh V. Pham, Tan D. Tran, Dung T. K. Ha 0001, My T. Thai. IJCAI 2023: 4127-4135 [doi]