Tan D. Tran

collaborators

2 papers

cs.DS2025

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint

Tan D. Tran, Canh V. Pham

This work studies the non-monotone DR-submodular Maximization over a ground set of $n$ subject to a size constraint $k$ . We propose two approximation algorithms for solving this pr…

cs.DS2025

Fast Stochastic Greedy Algorithm for $k$ -Submodular Cover Problem

Hue T. Nguyen, Tan D. Tran, Nguyen Long Giang +1

We study the $k$ -Submodular Cover ( $k S C$ ) problem, a natural generalization of the classical Submodular Cover problem that arises in artificial intelligence and combinatorial optim…

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint

Fast Stochastic Greedy Algorithm for k-Submodular Cover Problem

Fast Stochastic Greedy Algorithm for $k$ -Submodular Cover Problem