The following pages link to (Q4633864):
Displayed 19 items.
- Is submodularity testable? (Q472463) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- On additive approximate submodularity (Q2672599) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Approximate Modularity Revisited (Q5211809) (← links)
- Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
- (Q5743455) (← links)
- (Q5874477) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)