Pages that link to "Item:Q5741797"
From MaRDI portal
The following pages link to Online submodular welfare maximization: Greedy is optimal (Q5741797):
Displaying 24 items.
- Competitive online algorithms for resource allocation over the positive semidefinite cone (Q1650777) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
- Streaming algorithms for maximizing DR-submodular functions with \(d\)-knapsack constraints (Q2151370) (← 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 mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- Online Submodular Maximization with Free Disposal (Q4629970) (← links)
- (Q4969210) (← links)
- Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
- (Q5090369) (← links)
- (Q5111732) (← links)
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
- Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice (Q6542993) (← links)
- Edge-weighted online bipartite matching (Q6551261) (← links)
- Adwords in a panorama (Q6562830) (← links)
- Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)