Pages that link to "Item:Q5495032"
From MaRDI portal
The following pages link to A Unified Continuous Greedy Algorithm for Submodular Maximization (Q5495032):
Displaying 50 items.
- Blocking rumor by cut (Q721923) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Harnessing the power of deception in attack graph-based security games (Q2056942) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Nonsubmodular constrained profit maximization from increment perspective (Q2084631) (← links)
- Private non-monotone submodular maximization (Q2091093) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Multi-attribute based influence maximization in social networks: algorithms and analysis (Q2140569) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Viral marketing of online game by DS decomposition in social networks (Q2282998) (← links)
- Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Set function optimization (Q2314057) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Group fairness in non-monotone submodular maximization (Q2696943) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← 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)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- (Q4969174) (← links)
- (Q4969210) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- (Q5009516) (← links)
- (Q5075815) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- Prophet Matching with General Arrivals (Q5085120) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← 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)
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← 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)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
