Pages that link to "Item:Q4972676"
From MaRDI portal
The following pages link to Online Submodular Maximization with Preemption (Q4972676):
Displaying 15 items.
- Online budgeted maximum coverage (Q1979466) (← links)
- Online multistage subset maximization problems (Q2041973) (← links)
- Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
- Online algorithms for BP functions maximization (Q2222096) (← links)
- Online risk-averse submodular maximization (Q2678600) (← links)
- Submodular maximization over data streams with differential privacy noise (Q2680174) (← links)
- Online Submodular Maximization with Free Disposal (Q4629970) (← links)
- (Q5075745) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)
- Efficient algorithms for \(k\)-submodular function maximization with \(p\)-system and \(d\)-knapsack constraint (Q6606189) (← links)
- Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions (Q6610086) (← links)