Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
type: Item
instance of: scholarly article
title: Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
zbMATH Open document ID: 1502.91031
author: Yanjun Jiang
author: Yi-Jing Wang
author: Dachuan Xu
author: Donglei Du
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 91B39
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7603300
zbMATH Keywords: streaming algorithm
zbMATH Keywords: approximately submodular
zbMATH Keywords: linear function
zbMATH Keywords: bicriteria
MaRDI profile type: Publication
full work available at URL: s10878-021-00827-w
OpenAlex ID: W3211038545
cites work: Sparse high-dimensional regression: exact scalable algorithms and phase transitions
cites work: Simultaneous approximation of multi-criteria submodular function maximization
cites work: A threshold of ln n for approximating set cover
cites work: Guess free maximization of submodular and linear sums
cites work: Influence diffusion in social networks under time window constraints
cites work: Parametric monotone function maximization with matroid constraints
cites work: A simple greedy algorithm for the profit-aware social team formation problem
cites work: Data Streams: Algorithms and Applications
cites work: Optimization, approximation, and complexity classes
cites work: Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
cites work: Non-submodular maximization on massive data streams
cites work: A game-based approximate verification of deep neural networks with provable guarantees
DOI: 10.1007/S10878-021-00827-W
description: scientific article; zbMATH DE number 7603300