Author

Tan D. Tran

h-index 3 View on Semantic Scholar

We have 2 of 18 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Open access Sep 2026

Efficient Parallel Algorithms with Linear Queries for Non-Monotone Submodular Maximization

In this work, we propose the first constant-approximation algorithms, LinAst and LinAtg, which simultaneously achieve optimal query complexity O(n) and adaptive complexity O(log n) for non-monotone submodular maximization under a cardinality constraint k over a ground set of size n. Specifically, compared with existing...

Canh V. Pham, Tan D. Tran, Dung T. K. Ha et al. · Proceedings of the Thirty-Fi... · 0 citations

Conference Open access Sep 2026

Fairness k-Submodular Maximization Subject to Matroid Constraint

Comprehensive experiments on standard benchmark datasets demonstrate that the introduced constant-factor approximation algorithm achieves competitive objective values while maintaining a favorable balance between fairness guarantees and query complexity efficiency compared to existing state-of-the-art methods.

Tan D. Tran, Canh V. Pham, P. Pham · Proceedings of the Thirty-Fi... · 0 citations