Pages that link to "Item:Q2166001"
From MaRDI portal
The following pages link to A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001):
Displaying 4 items.
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
- A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems (Q5034057) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)