Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization

Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia. Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization. In Weili Wu 0001, Jianxiong Guo, editors, Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I. Volume 14461 of Lecture Notes in Computer Science, pages 287-299, Springer, 2023. [doi]

Abstract

Abstract is missing.