Pages that link to "Item:Q665998"
From MaRDI portal
The following pages link to On the complexity of submodular function minimisation on diamonds (Q665998):
Displaying 12 items.
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks (Q1747895) (← links)
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices (Q5041746) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)