Pages that link to "Item:Q2942658"
From MaRDI portal
The following pages link to Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658):
Displaying 9 items.
- Greedy matching: guarantees and limitations (Q513303) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Online BP functions maximization (Q2039657) (← links)
- Online algorithms for BP functions maximization (Q2222096) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- On maximizing sums of non-monotone submodular and linear functions (Q6130322) (← links)
