Dung T. K. Ha

According to our database, Dung T. K. Ha authored at least 17 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Practical algorithm for minimum cost submodular cover problem with performance guarantees.

Canh V. Pham, Tan D. Tran, Dung T. K. Ha, Quat V. Phu

Optim. Lett., December, 2025

Influence Maximization with Fairness Cost on Groups in Online Social Networks.

Hue T. Nguyen, Bac D. Pham, Dung T. K. Ha, Long Giang Nguyen, Canh V. Pham

Proceedings of the Intelligent Information and Database Systems - 17th Asian Conference, 2025

2024

Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity.

Hue T. Nguyen, Dung T. K. Ha, Canh V. Pham

Asia Pac. J. Oper. Res., December, 2024

Improved approximation algorithms for k-submodular maximization under a knapsack constraint.

Dung T. K. Ha, Canh V. Pham, Tan D. Tran

Comput. Oper. Res., January, 2024

Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint.

Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023

A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities.

Canh V. Pham, Dung K. Ha

Inf. Process. Lett., August, 2023

Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint.

Tan D. Tran, Canh V. Pham, Dung Ha

Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint.

Dung K. T. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang

Proceedings of the 15th International Conference on Knowledge and Systems Engineering, 2023

Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint.

Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem.

Canh V. Pham, Quat V. Phu, Dung T. K. Ha

Proceedings of the Computational Data and Social Networks - 12th International Conference, 2023

2022

Submodular Maximization Subject to a Knapsack Constraint Under Noise Models.

Dung K. Ha, Canh V. Pham, Huan X. Hoang

Asia Pac. J. Oper. Res., December, 2022

Maximizing k-submodular functions under budget constraint: applications and streaming algorithms.

Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen, Nguyen D. Le

J. Comb. Optim., 2022

Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint.

Canh V. Pham, Dung K. T. Ha, Huan X. Hoang, Tan D. Tran

Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

2021

Streaming Algorithms for Budgeted k-Submodular Maximization Problem.

Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen

Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

2020

Influence Maximization with Priority in Online Social Networks.

Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su, Huan X. Hoang

Algorithms, 2020

2016

A new viral marketing strategy with the competition in the large-scale online social networks.

Canh V. Pham, Dung K. Ha, Dung Q. Ngo, Quang C. Vu, Huan X. Hoang

Proceedings of the 2016 IEEE RIVF International Conference on Computing & Communication Technologies, 2016

Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks.

Canh V. Pham, My T. Thai, Dung K. Ha, Dung Q. Ngo, Huan X. Hoang

Proceedings of the Computational Social Networks - 5th International Conference, 2016