Approximations for monotone and nonmonotone submodular maximization with Knapsack constraints
| Year of publication: |
2013
|
|---|---|
| Authors: | Kulik, Ariel ; Shachnai, Hadas ; Tamir, Tami |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 38.2013, 4, p. 729-739
|
| Subject: | submodular maximization | knapsack constraints | maximum coverage | generalized assignment problem | randomization | approximation algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming |
-
Cheng, Lu, (2025)
-
An optimal streaming algorithm for submodular maximization with a cardinality constraint
Alaluf, Naor, (2022)
-
On maximizing a monotone k-submodular function under a knapsack constraint
Tang, Zhongzheng, (2022)
- More ...
-
Real-time scheduling to minimize machine busy times
Khandekar, Rohit, (2015)
-
Cost-sharing games in real-time scheduling systems
Tamir, Tami, (2023)
-
A refined analysis of submodular greedy
Kulik, Ariel, (2021)
- More ...