Bicriteria algorithms to balance coverage and cost in team formation under online model
From MaRDI portal
Publication:2220862
DOI10.1016/J.TCS.2020.12.002zbMATH Open1477.68545OpenAlexW3111889977MaRDI QIDQ2220862FDOQ2220862
Authors: Ran Ma, Yi-Jing Wang, Dachuan Xu, Donglei Du
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.002
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
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- A simple greedy algorithm for the profit-aware social team formation problem
- Simultaneous approximation of multi-criteria submodular function maximization
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- A game-based approximate verification of deep neural networks with provable guarantees
- Influence diffusion in social networks under time window constraints
- Parametric monotone function maximization with matroid constraints
- Guess free maximization of submodular and linear sums
Cited In (3)
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)