Pages that link to "Item:Q523157"
From MaRDI portal
The following pages link to New performance guarantees for the greedy maximization of submodular set functions (Q523157):
Displaying 14 items.
- A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q2029356) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- 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)
- Exact hypervolume subset selection through incremental computations (Q2669566) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- (Q3403832) (← links)
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (Q4943659) (← links)
- Two-stage submodular maximization under curvature (Q5925698) (← links)
- Improved algorithms for non-submodular function maximization problem (Q5970837) (← links)
- Two-stage non-submodular maximization (Q6132970) (← links)
- Two-stage BP maximization under \(p\)-matroid constraint (Q6204535) (← links)
- Fast deterministic algorithms for non-submodular maximization with strong performance guarantees (Q6568956) (← links)
- An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint (Q6614024) (← links)
