The following pages link to (Q4633938):
Displayed 18 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- Inferring Relative Ability from Winning Probability in Multientrant Contests (Q4987717) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5079734) (← links)
- Efficient Solution Methods for a General <i>r</i>-Interdiction Median Problem with Fortification (Q5086024) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
- Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)