Browse/Search Results: 1-3 of 3

Selected(0)Clear Items/Page: Sort:
	GREEDY+SINGLETON: An efficient approximation algorithm for k-submodular knapsack maximization Journal article Theoretical Computer Science,2024, volume: 984 Authors: Tang, Zhongzheng; Chen, Jingwen; Wang, Chenhao Favorite \| View/Download：5/0 \| Submit date：2024/03/12 Approximation algorithm Greedy algorithm Knapsack Submodularity
	On maximizing a monotone k-submodular function under a knapsack constraint Journal article Operations Research Letters,2022, volume: 50, issue: 1, pages: 28-31 Authors: Tang, Zhongzheng; Wang, Chenhao; Chan, Hau Favorite \| View/Download：9/0 \| Submit date：2022/02/23 Approximation algorithms k-Submodularity Knapsack
	A novel scene of viral marketing for complementary products Journal article IEEE Transactions on Computational Social Systems,2019, volume: 6, issue: 4, pages: 797-808 Authors: Guo, Jianxiong; Wu, Weili Favorite \| View/Download：5/0 \| Submit date：2022/05/26 Composite complementary products (CCP) influence maximization (IM) knapsack sandwich approximation social network viral marketing