Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint

In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in a streaming setting. In such a setting, elements arrive sequentially and at any point in time, and the algorithm can store only a small fraction of the elements that have arrived s...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 83; no. 3; pp. 879 - 902
Main Authors:	Huang, Chien-Chung, Kakimura, Naonori
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2021 Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Algorithms and Data Structures (WADS 2019) Computational Geometry Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Mathematics of Computing Theory of Computation Streaming algorithm Approximation algorithm Submodular functions
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!