A Streaming Model for Monotone Lattice Submodular Maximization with a Cardinality Constraint

Zhang, Zhenning; Guo, Longkun; Wang, Linyang; Zou, Juan

doi:10.1007/978-3-030-69244-5_32

Search citation statements

Order By: Relevance

Paper Sections

Select...

Acknowledgments1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article3

Book2

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…11801310). A preliminary version of this paper 13 has appeared in Proceedings of the 21th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2020).…”

Section: Acknowledgmentsmentioning

confidence: 99%

One‐pass streaming algorithm for monotone lattice submodular maximization subject to a cardinality constraint

Zhang

Guo

Wang

et al. 2021

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

In the article, we devise streaming algorithms for maximization of a monotone submodular function subject to a cardinality constraint on the integer lattice. Based on the observation that lattice submodularity is not equivalent to diminishing return submodularity on the integer lattice but rather a weaker condition, we propose a one-pass streaming algorithm with a modified binary search as subroutine of each step. Finally, we show that the algorithm is with approximation ratio 1∕2 − 𝜖, memory complexity O(𝜖 −1 k log k), and per-element query complexity O(𝜖 −2 log 2 k).

show abstract

Section: Acknowledgmentsmentioning

confidence: 99%