Pages that link to "Item:Q3012818"
From MaRDI portal
The following pages link to Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818):
Displaying 14 items.
- Robust monotone submodular function maximization (Q1801019) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
