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

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 83; číslo 3; s. 879 - 902
Hlavní autori:	Huang, Chien-Chung, Kakimura, Naonori
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2021 Springer Verlag
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!