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.DS2021
Streaming algorithms for Budgeted -Submodular Maximization problem
Canh V. Pham, Quang C. Vu, Dung K. T. Ha +1
Stimulated by practical applications arising from viral marketing. This paper investigates a novel Budgeted -Submodular Maximization problem defined as follows: Given a finite s…