Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity
Crossref DOI link: https://doi.org/10.1007/s10878-024-01232-9
Published Online: 2024-11-22
Published Print: 2025-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Pham, Canh V. https://orcid.org/0000-0002-8118-1768
Text and Data Mining valid from 2024-11-22
Version of Record valid from 2024-11-22
Article History
Accepted: 17 October 2024
First Online: 22 November 2024
Declarations
:
: All authors declare that have no conflicts of interest.