Pages that link to "Item:Q5962712"

The following pages link to Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712):

Displaying 21 items.

• On a general framework for network representability in discrete optimization (Q1631628) (← links)
• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• A compact representation for modular semilattices and its applications (Q2006979) (← links)
• Minimum 0-extension problems on directed metrics (Q2042078) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Uniform modular lattices and affine buildings (Q2194712) (← links)
• A nonpositive curvature property of modular semilattices (Q2230980) (← links)
• The vertex \(k\)-cut problem (Q2419357) (← links)
• Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
• Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
• Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
• A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
• (Q5002776) (← links)
• (Q5089214) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
• First-order logic axiomatization of metric graph theory (Q6196830) (← links)
• Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)