Streaming Algorithms for Maximization of a Non-submodular Function with a Cardinality Constraint on the Integer Lattice

We consider the maximization of a monotone non-submodular function with a cardinality constraint on the integer lattice. As our main contribution, two streaming algorithms with provable good performance guarantee and reasonable query time complexity are proposed.

Saved in:
Bibliographic Details
Published inParallel and Distributed Computing, Applications and Technologies Vol. 13148; pp. 460 - 465
Main Authors Tan, Jingjing, Sun, Yue, Xu, Yicheng, Zou, Juan
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2022
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Cardinality constraint
Integer lattice
Non-submodular
Streaming algorithm
Online AccessGet full text
ISBN9783030967710
3030967719
ISSN0302-9743
1611-3349
DOI10.1007/978-3-030-96772-7_42

Cover

More Information
Summary:We consider the maximization of a monotone non-submodular function with a cardinality constraint on the integer lattice. As our main contribution, two streaming algorithms with provable good performance guarantee and reasonable query time complexity are proposed.
Bibliography:J. Tan—Supported by Natural Science Foundation of Shandong Province (Nos. ZR2017LA002, ZR2019MA022), and Doctoral research foundation of Weifang University (No. 2017BS02). Y. Sun—Supported by National Natural Science Foundation of China (No. 11871081). Y. Xu—Supported by Guangxi Key Laboratory of Cryptography and Information Security (No. GCIS202116) and Natural Science Foundation of China (No. 11901558). J. Zou—Supported by National Natural Science Foundation of China (11801310).
ISBN:9783030967710
3030967719
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-96772-7_42