Pages that link to "Item:Q2220848"
From MaRDI portal
The following pages link to Maximize a monotone function with a generic submodularity ratio (Q2220848):
Displaying 11 items.
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
- Improved algorithms for non-submodular function maximization problem (Q5970837) (← links)
- Two-stage non-submodular maximization (Q6132970) (← links)
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)
- Fast deterministic algorithms for non-submodular maximization with strong performance guarantees (Q6568956) (← links)
- Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization (Q6646409) (← links)
