Bicriteria streaming algorithms to balance gain and cost with cardinality constraint

DOI10.1007/s10878-021-00827-wzbMath1502.91031OpenAlexW3211038545MaRDI QIDQ2084653

Yanjun Jiang, Dong-lei Du, Da-Chuan Xu, Yi-Jing Wang

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00827-w

zbMATH Keywords

linear functionbicriteriastreaming algorithmapproximately submodular

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Labor markets (91B39)

Cites Work

• Simultaneous approximation of multi-criteria submodular function maximization
• Optimization, approximation, and complexity classes
• A simple greedy algorithm for the profit-aware social team formation problem
• Parametric monotone function maximization with matroid constraints
• Sparse high-dimensional regression: exact scalable algorithms and phase transitions
• A game-based approximate verification of deep neural networks with provable guarantees
• Non-submodular maximization on massive data streams
• Influence diffusion in social networks under time window constraints
• A threshold of ln n for approximating set cover
• Data Streams: Algorithms and Applications
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Guess free maximization of submodular and linear sums

This page was built for publication: Bicriteria streaming algorithms to balance gain and cost with cardinality constraint