The following pages link to (Q2999661):
Displaying 28 items.
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
- Improved bounds for the greedy strategy in optimization problems with curvature (Q2424717) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- (Q4558139) (← links)
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963) (← links)
- (Q4969174) (← links)
- (Q5002781) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Approximating Robust Parameterized Submodular Function Maximization in Large-Scales (Q5193220) (← links)
- Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint (Q5232162) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)
- Optimal experimental design: formulations and computations (Q6598420) (← links)
- Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)
