Pages that link to "Item:Q5895002"

The following pages link to Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5895002):

Displaying 50 items.

• Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
• Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Generalized budgeted submodular set function maximization (Q2051778) (← links)
• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
• An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
• A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
• Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
• The matroid intersection cover problem (Q2661583) (← links)
• Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
• The multi-budget maximum weighted coverage problem (Q2692723) (← links)
• Practical budgeted submodular maximization (Q2701388) (← links)
• A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems (Q2904748) (← links)
• The power of local search: maximum coverage over a matroid (Q2904797) (← links)
• Max-Cut Under Graph Constraints (Q3186491) (← links)
• Submodular Stochastic Probing on Matroids (Q3186541) (← links)
• Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
• Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
• Maximizing Symmetric Submodular Functions (Q3452815) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5002614) (← links)
• Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
• Generalized budgeted submodular set function maximization (Q5005131) (← links)
• (Q5009516) (← links)
• Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
• The Power of Subsampling in Submodular Maximization (Q5085145) (← 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)
• Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
• (Q5743409) (← links)
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
• Submodular Optimization with Contention Resolution Extensions. (Q5875454) (← links)
• (Q5875486) (← links)
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5902164) (← links)
• Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
• Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
• Matroid-constrained vertex cover (Q6162073) (← links)
• Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
• Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)
• Weak submodularity implies localizability: local search for constrained non-submodular function maximization (Q6646409) (← links)