Pages that link to "Item:Q5236200"

The following pages link to An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation (Q5236200):

Displaying 27 items.

• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
• Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
• The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
• Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111) (← links)
• An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
• Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint (Q2151371) (← links)
• An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
• Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice (Q5024476) (← links)
• Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint (Q5024901) (← links)
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
• An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
• The Limitations of Optimization from Samples (Q5889795) (← links)
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5918257) (← links)
• Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331) (← 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)
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
• Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
• A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities (Q6161454) (← links)
• Adaptive algorithms on maximizing monotone nonsubmodular functions (Q6566785) (← links)
• Fast parallel algorithms for submodular \(p\)-superseparable maximization (Q6574951) (← links)
• Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models (Q6599123) (← links)