| Maximizing k-submodular functions under budget constraint: applications and streaming algorithms CV Pham, QC Vu, DKT Ha, TT Nguyen, ND Le Journal of Combinatorial Optimization 44 (1), 723-751, 2022 | 21 | 2022 |
| A new viral marketing strategy with the competition in the large-scale online social networks CV Pham, DK Ha, DQ Ngo, QC Vu, HX Hoang 2016 IEEE RIVF International Conference on Computing & Communication …, 2016 | 12 | 2016 |
| Time-critical viral marketing strategy with the competition on online social networks CV Pham, MT Thai, D Ha, DQ Ngo, HX Hoang International conference on computational social networks, 111-122, 2016 | 12 | 2016 |
| Streaming Algorithms for Budgeted k-Submodular Maximization Problem CV Pham, QC Vu, DKT Ha, TT Nguyen International Conference on Computational Data and Social Networks, 27-38, 2021 | 9 | 2021 |
| Fast streaming algorithms for k-submodular maximization under a knapsack constraint CV Pham, DKT Ha, HX Hoang, TD Tran 2022 IEEE 9th International Conference on Data Science and Advanced …, 2022 | 6 | 2022 |
| Influence maximization with priority in online social networks CV Pham, DKT Ha, QC Vu, AN Su, HX Hoang Algorithms 13 (8), 183, 2020 | 6 | 2020 |
| Linear query approximation algorithms for non-monotone submodular maximization under knapsack constraint CV Pham, TD Tran, DTK Ha, MT Thai arXiv preprint arXiv:2305.10292, 2023 | 2 | 2023 |
| Submodular Maximization Subject to a Knapsack Constraint Under Noise Models DTK Ha, CV Pham, HX Hoang Asia-Pacific Journal of Operational Research, 26, 2022 | 2 | 2022 |
| Improved Approximation Algorithms for K-Submodular Maximization Under a Knapsack Constraint DTK Ha, CV Pham, TD Tran Computers & Operations Research, 2023 | 1 | 2023 |
| Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity HT Nguyen, DTK Ha, CV Pham Asia-Pacific Journal of Operational Research, 2024 | | 2024 |
| Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem CV Pham, QV Phu, DTK Ha International Conference on Computational Data and Social Networks, 186-197, 2023 | | 2023 |
| Maximizing a -Submodular Maximization Function under an Individual Knapsack Constraint T Tran, C Pham, D Ha Proceedings of the 12th International Symposium on Information and …, 2023 | | 2023 |
| Robust Approximation Algorithms for Non-monotone -Submodular Maximization under a Knapsack Constraint DTK Ha, CV Pham, TD Tran, HX Hoang arXiv preprint arXiv:2309.12025, 2023 | | 2023 |
| A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities CV Pham, DTK Ha Information Processing Letters, 2023 | | 2023 |
Canh V. PhamPhD in Computer Science, ORLab, Phenikaa University在 phenikaa-uni.edu.vn 的电子邮件经过验证
Canh V. PhamPhD in Computer Science, ORLab, Phenikaa University在 phenikaa-uni.edu.vn 的电子邮件经过验证
Huan HoangVNU在 vnu.edu.vn 的电子邮件经过验证
Tan D. TranUniversity of Engineering and Technology在 vnu.edu.vn 的电子邮件经过验证