Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Tran, Tan D."'
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size $n$. Our algorithm improves the best approximation factor of the existing parallel one from $8
Externí odkaz:
http://arxiv.org/abs/2409.04415
The problem of non-monotone $k$-submodular maximization under a knapsack constraint ($\kSMK$) over the ground set size $n$ has been raised in many applications in machine learning, such as data summarization, information propagation, etc. However, ex
Externí odkaz:
http://arxiv.org/abs/2309.12025
This work, for the first time, introduces two constant factor approximation algorithms with linear query complexity for non-monotone submodular maximization over a ground set of size $n$ subject to a knapsack constraint, $\mathsf{DLA}$ and $\mathsf{R
Externí odkaz:
http://arxiv.org/abs/2305.10292
Publikováno v:
In Computers and Operations Research January 2024 161
Publikováno v:
International Journal of Distributed Sensor Networks; 11/10/2015, p1-13, 13p