Search Results - "Practical approximation algorithms"
-
1
Practical Budgeted Submodular Maximization
ISSN: 0178-4617, 1432-0541Published: New York Springer US 01.05.2023Published in Algorithmica (01.05.2023)“…We consider the problem of maximizing a non-negative monotone submodular function subject to a knapsack constraint, which is also known as the Budgeted Submodular Maximization ( BSM ) problem. Sviridenko (Operat Res Lett 32:41–43, 2004…”
Get full text
Journal Article