Pages that link to "Item:Q5429267"
From MaRDI portal
The following pages link to Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Q5429267):
Displaying 50 items.
- Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications (Q389651) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- New dominating sets in social networks (Q604953) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Robust mechanisms for risk-averse sellers (Q2212790) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Game-theoretic derivation of upper hedging prices of multivariate contingent claims and submodularity (Q2300963) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Submodularity and Randomized rounding techniques for Optimal Experimental Design (Q2883636) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Contact Center Scheduling with Strict Resource Requirements (Q3009760) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Experimental Design for Nonparametric Correction of Misspecified Dynamical Models (Q3176250) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- Idempotent Expansions for Continuous-Time Stochastic Control (Q3462518) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- Robust Adaptive Submodular Maximization (Q5060800) (← links)
- (Q5111732) (← links)
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Submodular Optimization with Contention Resolution Extensions. (Q5875454) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Beyond submodularity: a unified framework of randomized set selection with group fairness constraints (Q6039536) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Arbitrary profit sharing in federated learning utility games (Q6546278) (← links)
- Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models (Q6599123) (← links)
- Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)
