Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Mathematics of computing → Submodular optimization and polymatroids"'
The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5745a0fd32557344ffaa2ca59c6b0725
http://arxiv.org/abs/2305.00122
http://arxiv.org/abs/2305.00122
Autor:
Klimm, Max, Knaack, Martin
This paper studies the problem of maximizing a monotone submodular function under an unknown knapsack constraint. A solution to this problem is a policy that decides which item to pack next based on the past packing history. The robustness factor of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::295c5a8494a84e72066e3d5deafd45ce
http://arxiv.org/abs/2209.09668
http://arxiv.org/abs/2209.09668
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs), 229
49th EATCS International Conference on Automata, Languages, and Programming
49th EATCS International Conference on Automata, Languages, and Programming
Recent progress in (semi-)streaming algorithms for monotone submodular function maximization has led to tight results for a simple cardinality constraint. However, current techniques fail to give a similar understanding for natural generalizations, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0238a2ad816891d5758806c620a34dc
http://arxiv.org/abs/2107.07183
http://arxiv.org/abs/2107.07183
Autor:
Tang, Shaojie, Yuan, Jing
In this paper, we study the problem of maximizing the difference between an adaptive submodular (revenue) function and a non-negative modular (cost) function. The input of our problem is a set of n items, where each item has a particular state drawn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7999e04c5d05b7ae845a8adca94369a6
http://arxiv.org/abs/2103.00384
http://arxiv.org/abs/2103.00384