Pages that link to "Item:Q5918331"
From MaRDI portal
The following pages link to Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331):
Displaying 4 items.
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation (Q5236200) (← links)
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification (Q5274808) (← links)
- Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions (Q6610086) (← links)