A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint

We present a refined analysis of a variant of the algorithm in the literature for solving the knapsack-constrained submodular maximization problem. By deriving a strong approximation bound for this variant, we reduce the size of the sets requiring enumeration, from two to one, to ensure the final al...

Celý popis

Podrobná bibliografia

Vydané v:	Operations research letters Ročník 61; s. 107295
Hlavný autor:	Lu, Cheng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2025
Predmet:	Approximation algorithm Greedy algorithm Knapsack constraint Submodular maximization Greedy algorithm Submodular maximization Approximation algorithm Knapsack constraint
ISSN:	0167-6377
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!