The following pages link to (Q2958605):
Displaying 11 items.
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
- Distributed maximum maintenance on hierarchically divided graphs (Q2366165) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- (Q2958605) (← links)
- (Q4998943) (← links)
- Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems (Q5034057) (← links)
- (Q5053276) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)