Canyam
AI summaries for academic research
Home
Preprint
Subscribe
Favorites
Tools
Analysis
Summary
Not logged in
Back
C
Canh V. Pham
indiana university purdue university fort wayne
10
H-index
53
Paper Count
405
Citation Count
0
Related Insights
Subscribe
Published Papers
5
Publication Date
Publication Date
Impact Factor
Citations
Efficient Deterministic Bicriteria Approximation Algorithms for k-Submodular Cover Problem
Asia-Pacific Journal of Operational Research
IF
1
2026-05-01
0
PRE
AI
Nguyen, Hue T.; Giang, Nguyen Long; Pham, Canh V.
Share
Save
Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
Journal of Combinatorial Optimization
IF
1.1
2025-12-28
0
PRE
AI
Tran, Tan D.; Pham, Canh V.
Share
Save
Fast bicriteria streaming algorithms for submodular cover problem under noise models
COMPUTER STANDARDS & INTERFACES
IF
3.1
2025-01-01
0
PRE
AI
Nguyen, Bich-Ngan T.; Pham, Phuong N. H.; V. Pham, Canh; Snasel, Vaclav
Share
Save
Improved approximation algorithms for k-submodular maximization under a knapsack constraint
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2024-01-01
1
PRE
AI
Ha, Dung T. K.; V. Pham, Canh; Tran, Tan D.
Share
Save
Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks
IEEE ACCESS
IF
3.6
2020-01-01
73
OA
AI
Pham, Dung, V; Nguyen, Giang L.; Nguyen, Tu N.; Pham, Canh, V; Nguyen, Anh, V
Share
Save
Research Directions
No research directions
Co-authors
Cooperation Journals
V
Václav Snåšel
H-index: 49 · Papers: 1.0K
T
Tu N. Nguyen
H-index: 46 · Papers: 188
N
Nguyễn Long Giang
H-index: 18 · Papers: 125
D
Duc–Tan Tran
H-index: 18 · Papers: 295
T
Tan Tran
H-index: 3 · Papers: 11
View more