Online bicriteria algorithms to balance coverage and cost in team formation

DOI10.1007/978-3-030-57602-8_3zbMATH Open1482.68279OpenAlexW3048073397MaRDI QIDQ2039641FDOQ2039641

Authors: Ran Ma, Yi-Jing Wang, Dachuan Xu, Donglei Du 

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_3

Recommendations

• Bicriteria algorithms to balance coverage and cost in team formation under online model
• Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
• Shrinking maxima, decreasing costs: new online packing and covering problems
• Greedy algorithms for the profit-aware social team formation problem

zbMATH Keywords

balancelinear functionbicriteria algorithmapproximately submodular

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Cites Work

• A simple greedy algorithm for the profit-aware social team formation problem
• Simultaneous approximation of multi-criteria submodular function maximization
• Parametric monotone function maximization with matroid constraints
• Guess free maximization of submodular and linear sums

Cited In (4)

• Greedy algorithms for the profit-aware social team formation problem
• Bicriteria algorithms to balance coverage and cost in team formation under online model
• Online team formation under different synergies
• Bicriteria streaming algorithms to balance gain and cost with cardinality constraint

This page was built for publication: Online bicriteria algorithms to balance coverage and cost in team formation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039641)