The following pages link to Learning submodular functions (Q5419150):
Displayed 18 items.
- Is submodularity testable? (Q472463) (← links)
- Buy-many mechanisms are not much better than item pricing (Q2155888) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- On additive approximate submodularity (Q2672599) (← links)
- Recognizing Coverage Functions (Q2944461) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
- (Q4638085) (← links)
- Approximate Modularity Revisited (Q5211809) (← links)
- (Q5743455) (← links)
- (Q5743502) (← links)
- The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)
- (Q6087218) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)