Publications

All Journal Proceedings

2025

  1. Practical Algorithm for Minimum Cost Submodular Cover Problem with Performance Guarantees Canh V. Pham, Tan D. Tran, Dung T. K. Ha, and 1 more author ; Optimization Letters, 2025
  2. A new heuristic algorithm for Student-Project Allocation with lecturer preferences and Ties Uyen T. Nguyen, Sang X. Tran, and Canh V. Pham ; Asia-Pacific Journal of Operational Research, 2025
  3. Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity Canh V. Pham ; Journal of Combinatorial Optimization, 2025

2024

  1. Fast bicriteria streaming algorithms for submodular cover problem under noise models Bich-Ngan T. Nguyen, Phuong H.N. Pham, Canh V. Pham*, and 1 more author ; Computer Standards and Interfaces, 2024
  2. Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity Nguyen Hue T., Dung T. K. Ha, and Canh V. Pham ; Asia-Pacific Journal of Operational Research, 2024
  3. Improved approximation algorithms for k-submodular maximization under a knapsack constraint Dung T. K. Ha, Canh V. Pham*, and Tan D. Tran ; Computers & Operations Research, 2024

2023

  1. Minimizing cost for influencing target groups in social network: A model and algorithmic approach Phuong N. H. Pham, Canh V. Pham*, Hieu V. Duong, and 2 more authors ; Computer Communication, 2023
  2. A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities Canh V. Pham, and Dung K. Ha ; Information Processing Letters, 2023

2022

  1. Submodular Maximization Subject to a Knapsack Constraint Under Noise Models Dung K. Ha, Canh V. Pham*, and Huan X. Hoang ; Asia-Pacific Journal of Operational Research, 2022
  2. Maximizing k-submodular functions under budget constraint: applications and streaming algorithms Canh V. Pham, Quang C. Vu, Dung K. Ha, and 2 more authors ; Journal of Combinatorial Optimization, 2022
  3. Minimum budget for misinformation detection in online social networks with provable guarantees Canh V. Pham, Dung V. Pham, Bao Q. Bui, and 1 more author ; Optimization Letters, 2022

2020

  1. Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks Dung V. Pham, Long Giang Nguyen, Ngoc-Tu Nguyen, and 2 more authors ; IEEE Access, 2020
  2. Influence Maximization with Priority in Online Social Networks Canh V. Pham, Dung K. T. Ha, Quang C. Vu, and 2 more authors ; Algorithms, 2020

2019

  1. Minimum budget for misinformation blocking in online social networks Canh V. Pham, Quat V. Phu, Huan X. Hoang, and 2 more authors ; Journal of Combinatorial Optimization, 2019

2018

  1. Maximizing misinformation restriction within time and budget constraints Canh V. Pham, My T. Thai, Hieu V. Duong, and 2 more authors ; Journal of Combinatorial Optimization, 2018