Pages that link to "Item:Q4178796"

The following pages link to Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796):

Displaying 50 items.

• Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
• Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline (Q2947023) (← links)
• (Q2958605) (← links)
• A Probabilistic Analysis of the K-Location Problem (Q3136634) (← links)
• Robust Monotone Submodular Function Maximization (Q3186512) (← links)
• Submodular Stochastic Probing on Matroids (Q3186541) (← links)
• Gradient methods of maximization of convex functions on discrete structures (Q3747234) (← links)
• A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
• Maximizing set function formulation of two scheduling problems (Q4015963) (← links)
• NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
• A first hitting time approach to finding effective spreaders in a network (Q4965258) (← links)
• Online Submodular Maximization with Preemption (Q4972676) (← links)
• (Q4998943) (← links)
• (Q5009516) (← links)
• 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)
• Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)
• Regularized nonmonotone submodular maximization (Q6548318) (← links)
• Fast deterministic algorithms for non-submodular maximization with strong performance guarantees (Q6568956) (← links)
• Fast parallel algorithms for submodular \(p\)-superseparable maximization (Q6574951) (← links)
• Optimal experimental design: formulations and computations (Q6598420) (← links)
• Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models (Q6599123) (← links)
• Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions (Q6610086) (← links)