Pages that link to "Item:Q4178796"
From MaRDI portal
The following pages link to Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796):
Displayed 32 items.
- Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
- (Q5053276) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- (Q5075815) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- (Q5090369) (← links)
- (Q5090397) (← links)
- (Q5091209) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- An Improved Analysis of Local Search for Max-Sum Diversification (Q5108253) (← 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)
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← 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)
- Guess free maximization of submodular and linear sums (Q5925508) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations (Q6095506) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- On maximizing sums of non-monotone submodular and linear functions (Q6130322) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
- Streaming submodular maximization with the chance constraint (Q6166877) (← 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)