Pages that link to "Item:Q967393"
From MaRDI portal
The following pages link to The expressive power of binary submodular functions (Q967393):
Displaying 16 items.
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- Generalized roof duality (Q714031) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity (Q3462365) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)