Lu, C. (2025). A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint. Operations research letters, 61, 107295. https://doi.org/10.1016/j.orl.2025.107295
Chicago Style (17th ed.) CitationLu, Cheng. "A Note on Fast Deterministic Algorithms for Non-monotone Submodular Maximization Under a Knapsack Constraint." Operations Research Letters 61 (2025): 107295. https://doi.org/10.1016/j.orl.2025.107295.
MLA (9th ed.) CitationLu, Cheng. "A Note on Fast Deterministic Algorithms for Non-monotone Submodular Maximization Under a Knapsack Constraint." Operations Research Letters, vol. 61, 2025, p. 107295, https://doi.org/10.1016/j.orl.2025.107295.
Warning: These citations may not always be 100% accurate.