Pages that link to "Item:Q5112585"

The following pages link to Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes (Q5112585):

Displaying 50 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Submodular unsplittable flow on trees (Q1801021) (← links)
• Adaptive robust submodular optimization and beyond (Q2039658) (← links)
• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
• Contention resolution, matrix scaling and fair allocation (Q2085755) (← 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)
• 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)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
• Measured continuous greedy with differential privacy (Q2151374) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
• Price of dependence: stochastic submodular maximization with dependent items (Q2292144) (← links)
• Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
• Constrained submodular maximization via greedy local search (Q2294252) (← links)
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
• A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
• The multi-budget maximum weighted coverage problem (Q2692723) (← links)
• On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
• A simple optimal contention resolution scheme for uniform matroids (Q2699957) (← links)
• The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
• (Q4969174) (← links)
• (Q5002781) (← links)
• (Q5009622) (← links)
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
• Prophet Matching with General Arrivals (Q5085120) (← links)
• A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← 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)
• Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
• (Q5136324) (← links)
• Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← 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)
• (Q5875486) (← links)
• (Q5875506) (← links)
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5918257) (← links)
• Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
• Stochastic submodular probing with state-dependent costs (Q5918543) (← links)
• Stochastic submodular probing with state-dependent costs (Q5918731) (← links)
• \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
• Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)