Canh V. Pham

Orcid: 0000-0002-8118-1768

According to our database1, Canh V. Pham authored at least 33 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved approximation algorithms for k-submodular maximization under a knapsack constraint.
Comput. Oper. Res., January, 2024

2023
Minimizing cost for influencing target groups in social network: A model and algorithmic approach.
Comput. Commun., December, 2023

A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities.
Inf. Process. Lett., August, 2023

Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint.
CoRR, 2023

Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint.
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.
Proceedings of the 15th International Conference on Knowledge and Systems Engineering, 2023

Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem.
Proceedings of the Computational Data and Social Networks - 12th International Conference, 2023

Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem.
Proceedings of the Computational Data and Social Networks - 12th International Conference, 2023

2022
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models.
Asia Pac. J. Oper. Res., December, 2022

Minimum budget for misinformation detection in online social networks with provable guarantees.
Optim. Lett., 2022

Maximizing k-submodular functions under budget constraint: applications and streaming algorithms.
J. Comb. Optim., 2022

k-Submodular Cover Problem: Application and Algorithms.
Proceedings of the 11th International Symposium on Information and Communication Technology, 2022

Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint.
Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

A Heuristic Algorithm for Student-Project Allocation Problem.
Proceedings of the Computational Data and Social Networks - 11th International Conference, 2022

2021
Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks.
Proceedings of the RIVF International Conference on Computing and Communication Technologies, 2021

Streaming Algorithm for Submodular Cover Problem Under Noise.
Proceedings of the RIVF International Conference on Computing and Communication Technologies, 2021

Threshold Benefit for Groups Influence in Online Social Networks.
Proceedings of the Future Data and Security Engineering - 8th International Conference, 2021

Streaming Algorithms for Budgeted k-Submodular Maximization Problem.
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

Groups Influence with Minimum Cost in Social Networks.
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

2020
Influence Maximization with Priority in Online Social Networks.
Algorithms, 2020

Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks.
IEEE Access, 2020

2019
Minimum budget for misinformation blocking in online social networks.
J. Comb. Optim., 2019

Competitive Influence Maximization on Online Social Networks: A Deterministic Modeling Approach.
Proceedings of the 2019 IEEE-RIVF International Conference on Computing and Communication Technologies, 2019

Multiple Topics Misinformation blocking in Online Social Networks.
Proceedings of the 11th International Conference on Knowledge and Systems Engineering, 2019

Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing.
Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

2018
Maximizing misinformation restriction within time and budget constraints.
J. Comb. Optim., 2018

Budgeted Competitive Influence Maximization on Online Social Networks.
Proceedings of the Computational Data and Social Networks - 7th International Conference, 2018

Targeted Misinformation Blocking on Online Social Networks.
Proceedings of the Intelligent Information and Database Systems - 10th Asian Conference, 2018

2017
Limiting the Spread of Epidemics within Time Constraint on Online Social Networks.
Proceedings of the Eighth International Symposium on Information and Communication Technology, 2017

2016
A new viral marketing strategy with the competition in the large-scale online social networks.
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.
Proceedings of the Computational Social Networks - 5th International Conference, 2016

2015
Preventing and Detecting Infiltration on Online Social Networks.
Proceedings of the Computational Social Networks - 4th International Conference, 2015


  Loading...