The following pages link to L-CONVEXITY ON GRAPH STRUCTURES (Q4642057):
Displaying 16 items.
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- A compact representation for modular semilattices and its applications (Q2006979) (← links)
- A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem (Q2089770) (← links)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- Uniform modular lattices and affine buildings (Q2194712) (← links)
- A nonpositive curvature property of modular semilattices (Q2230980) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← 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)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- Old and new challenges in Hadamard spaces (Q6052560) (← links)
