Bicriteria algorithms to balance coverage and cost in team formation under online model
From MaRDI portal
Publication:2220862
Recommendations
- Online bicriteria algorithms to balance coverage and cost in team formation
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
- Greedy algorithms for the profit-aware social team formation problem
- Shrinking maxima, decreasing costs: new online packing and covering problems
- Shrinking maxima, decreasing costs: new online packing and covering problems
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
- Guess free maximization of submodular and linear sums
- Influence diffusion in social networks under time window constraints
- 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
(7)- Online bicriteria algorithms to balance coverage and cost in team formation
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
- Online team formation under different synergies
- A multi-pass streaming algorithm for regularized submodular maximization
- Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint
- Greedy algorithms for the profit-aware social team formation problem
This page was built for publication: Bicriteria algorithms to balance coverage and cost in team formation under online model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220862)