Pages that link to "Item:Q2294252"
From MaRDI portal
The following pages link to Constrained submodular maximization via greedy local search (Q2294252):
Displaying 13 items.
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- A constrained two-stage submodular maximization (Q2220851) (← links)
- Submodular minimization under congruency constraints (Q2300162) (← links)
- On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- The power of local search: maximum coverage over a matroid (Q2904797) (← links)
- (Q3403832) (← links)
- Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- Profit maximization for competitive influence spread in social networks (Q6591656) (← links)
- Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)
