Pages that link to "Item:Q5212750"
From MaRDI portal
The following pages link to Submodular maximization with matroid and packing constraints in parallel (Q5212750):
Displayed 5 items.
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
- A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities (Q6161454) (← links)