The following pages link to (Q5365102):
Displaying 41 items.
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Explaining anomalies in groups with characterizing subspace rules (Q1741431) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Private non-monotone submodular maximization (Q2091093) (← 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)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- (Q2958605) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← 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)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- (Q4969174) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- A fast double greedy algorithm for non-monotone DR-submodular function maximization (Q5216445) (← links)
- (Q5743502) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
- Weakly Submodular Function Maximization Using Local Submodularity Ratio. (Q6065474) (← links)
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity (Q6118307) (← links)
- On maximizing sums of non-monotone submodular and linear functions (Q6130322) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)
- Regularized nonmonotone submodular maximization (Q6548318) (← links)
- Data summarization beyond monotonicity: non-monotone two-stage submodular maximization (Q6606190) (← links)
- Two-stage submodular maximization problem beyond nonnegative and monotone (Q6620015) (← links)
