2 papers
cs.AI2024
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint
Tan D. Tran, Canh V. Pham, Dung T. K. Ha +1
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size . Our algorithm impro…
cs.GT2021
Groups Influence with Minimum Cost in Social Networks
Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong +2
This paper studies a Group Influence with Minimum cost which aims to find a seed set with smallest cost that can influence all target groups, where each user is associated with a c…