An optimal streaming algorithm for submodular maximization with a cardinality constraint
Year of publication: |
2022
|
---|---|
Authors: | Alaluf, Naor ; Ene, Alina ; Feldman, Moran ; Nguyen, Huy L. ; Suh, Andrew |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 4, p. 2667-2690
|
Subject: | cardinality constraint | semi-streaming algorithms | submodular maximization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming |
-
Approximations for monotone and nonmonotone submodular maximization with Knapsack constraints
Kulik, Ariel, (2013)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
Frequency capping in online advertising
Buchbinder, Niv, (2014)
-
A simple O(log log(rank))-competitive algorithm for the matroid secretary problem
Feldman, Moran, (2018)
-
Non-preemptive buffer management for latency sensitive packets
Feldman, Moran, (2017)
- More ...