Pages that link to "Item:Q3096096"
From MaRDI portal
The following pages link to Maximizing Non-monotone Submodular Functions (Q3096096):
Displayed 50 items.
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← 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)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- (Q4638085) (← links)
- (Q4969174) (← links)
- (Q4969210) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- (Q4998943) (← links)
- (Q5005131) (← links)
- (Q5009516) (← links)
- <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5090369) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← 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)
- Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- (Q5743502) (← links)
- Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
- Submodular Optimization with Contention Resolution Extensions. (Q5875454) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331) (← links)
- Posimodular function optimization (Q5918641) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Efficient Optimization of Partition Scan Statistics via the Consecutive Partitions Property (Q6094100) (← links)
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations (Q6095506) (← 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)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
- Constraint generation approaches for submodular function maximization leveraging graph properties (Q6154401) (← links)
- A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)
- Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise (Q6167013) (← links)
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)