Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice

The study of non-submodular maximization on the integer lattice is an important extension of submodular optimization. In this paper, streaming algorithms for maximizing non-negative monotone non-submodular functions with knapsack constraint on integer lattice are considered. We first design a two-pa...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 937; pp. 39 - 49
Main Authors:	Tan, Jingjing, Wang, Fengmin, Ye, Weina, Zhang, Xiaoqing, Zhou, Yang
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 18.11.2022
Subjects:	Integer lattice Knapsack constraint Non-submodular Streaming algorithms Streaming algorithms Integer lattice Non-submodular Knapsack constraint
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!