Streaming algorithms for robust submodular maximization
Submodular maximization is well studied in the fields of data mining and machine learning. We study the submodular maximization subject to a cardinality constraint k for large scale scenarios applications under two combined settings. One is that all elements arrive in a streaming fashion, and the ot...
Saved in:
Published in | Discrete Applied Mathematics Vol. 290; pp. 112 - 122 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
15.02.2021
Elsevier BV |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!