Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
From MaRDI portal
Publication:2084653
Recommendations
- Online bicriteria algorithms to balance coverage and cost in team formation
- Bicriteria algorithms to balance coverage and cost in team formation under online model
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
- Streaming algorithms for submodular function maximization
Cites work
- A game-based approximate verification of deep neural networks with provable guarantees
- A simple greedy algorithm for the profit-aware social team formation problem
- A threshold of ln n for approximating set cover
- Data Streams: Algorithms and Applications
- Guess free maximization of submodular and linear sums
- Influence diffusion in social networks under time window constraints
- Non-submodular maximization on massive data streams
- Optimization, approximation, and complexity classes
- Parametric monotone function maximization with matroid constraints
- Simultaneous approximation of multi-criteria submodular function maximization
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
Cited in
(2)
This page was built for publication: Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084653)
