Pages that link to "Item:Q5212748"
From MaRDI portal
The following pages link to An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model (Q5212748):
Displaying 7 items.
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- (Q5053276) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
- A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities (Q6161454) (← links)
- Adaptive algorithms on maximizing monotone nonsubmodular functions (Q6566785) (← links)
- Fast parallel algorithms for submodular \(p\)-superseparable maximization (Q6574951) (← links)
