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 2023 · cs.DSShow all

2 papers · 2 filters

cs.DS2023

Robust Approximation Algorithms for Non-monotone $k$ -Submodular Maximization under a Knapsack Constraint

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

The problem of non-monotone $k$ -submodular maximization under a knapsack constraint ($\kSMK$) over the ground set size $n$ has been raised in many applications in machine learning,…

cs.DS2023★ 1 cited

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

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

This work, for the first time, introduces two constant factor approximation algorithms with linear query complexity for non-monotone submodular maximization over a ground set of si…

Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint

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

Robust Approximation Algorithms for Non-monotone $k$ -Submodular Maximization under a Knapsack Constraint