Pages that link to "Item:Q3058545"
From MaRDI portal
The following pages link to Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints (Q3058545):
Displayed 50 items.
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Nonsubmodular constrained profit maximization from increment perspective (Q2084631) (← links)
- The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Inequalities on submodular functions via term rewriting (Q2444736) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← 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)
- Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← 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)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- (Q5743409) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Submodular Optimization with Contention Resolution Extensions. (Q5875454) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
- Two-stage submodular maximization under curvature (Q5918724) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- Two-stage submodular maximization under curvature (Q5925698) (← links)
- Weakly Submodular Function Maximization Using Local Submodularity Ratio. (Q6065474) (← links)
- Two-stage submodular maximization under knapsack and matroid constraints (Q6111952) (← links)
- Two-stage non-submodular maximization (Q6111964) (← links)
- Two-stage BP maximization under \(p\)-matroid constraint (Q6113876) (← links)
- Two-stage non-submodular maximization (Q6132970) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6168972) (← links)
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)