Get started
Author

Dung T. K. Ha

Observed names: Dung Ha, Dung T.K. Ha
Institution: Phenikaa University
ORCID: 0000-0001-8375-7866
Observed ORCID: 0000-0001-8375-7866
OpenAlex ID: A5073998124
Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks
2016 · Canh V. Pham, My T. Thai, et al. · Lecture notes in computer science · 12
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint
2023 · Canh V. Pham, Tan D. Tran, et al. · International Joint Conference on Artificial Intelligence · 9
PDF
Improved approximation algorithms for k -submodular maximization under a knapsack constraint
2023 · Dung T.K. Ha, Canh V. Pham, et al. · Computers & Operations Research · 8
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
2022 · Dung T. K. Ha, Canh V. Pham, et al. · Asia Pacific Journal of Operational Research · 2
Influence Maximization with Fairness Cost on Groups in Online Social Networks
2025 · Hue T. Nguyen, Bac D. Pham, et al. · Lecture notes in computer science · 1
Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint
2023 · Dung T.K. Ha, Canh V. Pham, et al. · International Conference on Knowledge and Systems Engineering/Proceedings · 1
PDF
Efficient Parallel Algorithms with Linear Queries for Non-Monotone Submodular Maximization
2026 · Canh V. Pham, Tan D. Tran, et al. · International Joint Conference on Artificial Intelligence
PDF
Budgeted Object Detection via Online Submodular Approximation Algorithm
2026 · Dung T. K. Ha, Anh T. N. Vu, et al. · Communications in computer and information science
k-Submodular Maximization Under Individual Knapsack Constraints: Applications and Streaming Algorithm
2025 · Tan D. Tran, Canh V. Pham, et al. · Asia Pacific Journal of Operational Research
Practical algorithm for minimum cost submodular cover problem with performance guarantees
2025 · Canh V. Pham, Tan D. Tran, et al. · Optimization Letters
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint
2024 · Tan D. Tran, Canh V. Pham, et al. · International Joint Conference on Artificial Intelligence
PDF
Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity
2024 · Hue T. Nguyen, Dung T. K. Ha, et al. · Asia Pacific Journal of Operational Research
Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem
2024 · Canh V. Pham, Quat V. Phu, et al. · Lecture notes in computer science
Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint
2023 · Tan Tran, Canh Pham, et al. · International Symposium on Information and Communication Technology
PDF
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities
2023 · Canh V. Pham, Dung T.K. Ha · Information Processing Letters
Works count: 15
Citation count: 33
H-index: 3
I10-index: 1
Year
Topic
Type