The following pages link to (Q2958605):
Displaying 9 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)
- Practical budgeted submodular maximization (Q2701388) (← links)
- (Q2958605) (← links)
- (Q4998943) (← links)
- (Q5053276) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- LIC criterion for optimal subset selection in distributed interval estimation (Q6164644) (← links)