Pages that link to "Item:Q5963607"
From MaRDI portal
The following pages link to Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607):
Displaying 16 items.
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees (Q2184512) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
- Improved bounds for the greedy strategy in optimization problems with curvature (Q2424717) (← links)
- A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- Constrained Monotone Function Maximization and the Supermodular Degree (Q2969616) (← links)
- A first hitting time approach to finding effective spreaders in a network (Q4965258) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
