z-logo
open-access-imgOpen Access
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Author(s) -
Georgios Amanatidis,
Federico Fusco,
Philip Lazos,
Stefano Leonardi,
Rebecca Reiffenhäuser
Publication year - 2022
Publication title -
journal of artificial intelligence research/the journal of artificial intelligence research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.79
H-Index - 123
eISSN - 1943-5037
pISSN - 1076-9757
DOI - 10.1613/jair.1.13472
Subject(s) - submodular set function , knapsack problem , monotone polygon , maximization , mathematical optimization , constraint (computer aided design) , computer science , greedy algorithm , approximation algorithm , mathematics , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here