The following publications are possibly variants of this publication:
- Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack ConstraintCanh V. Pham, Dung K. T. Ha 0001, Huan X. Hoang, Tan D. Tran. dsaa 2022: 1-10 [doi]
- Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack MaximizationZhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia. cocoa 2024: 287-299 [doi]
- Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton AlgorithmJingwen Chen, Zhongzheng Tang, Chenhao Wang 0001. AAIM 2022: 144-155 [doi]
- An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack MaximizationZhongzheng Tang, Jingwen Chen, Chenhao Wang 0001. faw 2023: 15-28 [doi]
- Beyond Pointwise Submodularity: Non-monotone Adaptive Submodular Maximization Subject to Knapsack and k-System ConstraintsShaoJie Tang. mco 2022: 16-27 [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]
- Submodular Maximization under the Intersection of Matroid and Knapsack ConstraintsYu-Ran Gu, Chao Bian 0002, Chao Qian 0001. AAAI 2023: 3959-3967 [doi]