Canh V. Pham

activity

20192025

most citedLinear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Streaming algorithms for Budgeted $k$ -Submodular Maximization problem

Canh V. Pham, Quang C. Vu, Dung K. T. Ha +1

Stimulated by practical applications arising from viral marketing. This paper investigates a novel Budgeted $k$ -Submodular Maximization problem defined as follows: Given a finite s…

cs.GT2021

Groups Influence with Minimum Cost in Social Networks

Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong +2

This paper studies a Group Influence with Minimum cost which aims to find a seed set with smallest cost that can influence all target groups, where each user is associated with a c…

Streaming algorithms for Budgeted k-Submodular Maximization problem

Groups Influence with Minimum Cost in Social Networks

Streaming algorithms for Budgeted $k$ -Submodular Maximization problem