Theo dõi
Dung T.K. Ha
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
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
212022
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
122016
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
112016
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
72021
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
62022
Influence maximization with priority in online social networks
CV Pham, DKT Ha, QC Vu, AN Su, HX Hoang
Algorithms 13 (8), 183, 2020
62020
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
DTK Ha, CV Pham, HX Hoang
Asia-Pacific Journal of Operational Research, 26, 2022
22022
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
12023
Improved Approximation Algorithms for K-Submodular Maximization Under a Knapsack Constraint
DTK Ha, CV Pham, TD Tran
Computers & Operations Research, 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
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–11