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

Summary 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 r...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 35; no. 17
Main Authors:	Zhang, Zhenning, Guo, Longkun, Wang, Linyang, Zou, Juan
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 01.08.2023
Subjects:	Algorithms cardinality Complexity integer lattice Integers lattice submodular Maximization memory complexity Optimization streaming algorithm
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!