Pages that link to "Item:Q408438"
From MaRDI portal
The following pages link to Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438):
Displaying 5 items.
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint (Q6201343) (← links)
