Pages that link to "Item:Q3225171"
From MaRDI portal
The following pages link to Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (Q3225171):
Displaying 50 items.
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Price of dependence: stochastic submodular maximization with dependent items (Q2292144) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
- Set function optimization (Q2314057) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- Inequalities on submodular functions via term rewriting (Q2444736) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- Online risk-averse submodular maximization (Q2678600) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- Unified algorithms for online learning and competitive analysis (Q2806821) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- (Q2958605) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Maximizing Non-monotone Submodular Functions (Q3096096) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Differentially Private and Budget-Limited Bandit Learning over Matroids (Q3386800) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- (Q4558139) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Algorithmic Aspects of Private Bayesian Persuasion. (Q4638086) (← links)
- (Q4969174) (← links)
- (Q4969210) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- When Are Welfare Guarantees Robust (Q5002625) (← links)
- (Q5002781) (← links)
- Generalized budgeted submodular set function maximization (Q5005131) (← links)
- (Q5009622) (← links)
- <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
- Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← 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)
- 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)
- Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms (Q5031662) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)