American Psychological Association 6th edition

Pham, C. V. (2025). Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. Journal of Combinatorial Optimization, 49(1). https://doi.org/10.1007/s10878-024-01232-9

ISO-690 (author-date, English)

PHAM, Canh V., 2025. Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. Journal of Combinatorial Optimization. 1 January 2025. Vol. 49, no. 1, . DOI 10.1007/s10878-024-01232-9.

Modern Language Association 9th edition

Pham, C. V. “Enhanced Deterministic Approximation Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint With Linear Query Complexity”. Journal of Combinatorial Optimization, vol. 49, no. 1, Jan. 2025, https://doi.org/10.1007/s10878-024-01232-9.

Mohr Siebeck - Recht (Deutsch - Österreich)

Pham, Canh V.: Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity, Journal of Combinatorial Optimization 2025,

Emerald - Harvard

Pham, C.V. (2025), “Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity”, Journal of Combinatorial Optimization, Vol. 49 No. 1, available at:https://doi.org/10.1007/s10878-024-01232-9.

Warning: These citations may not always be 100% accurate.