L-CONVEXITY ON GRAPH STRUCTURES
From MaRDI portal
Publication:4642057
DOI10.15807/jorsj.61.71zbMath1391.90475arXiv1610.02469OpenAlexW2963059622MaRDI QIDQ4642057
Publication date: 18 May 2018
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02469
combinatorial optimizationsubmodular function\(\mathrm{CAT}(0)\) spacediscrete convex analysisweakly modular graph\(L^{\natural}\)-convex function
Related Items (16)
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity ⋮ Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- ⋮ Scaling, proximity, and optimization of integrally convex functions ⋮ Old and new challenges in Hadamard spaces ⋮ Discrete Midpoint Convexity ⋮ Uniform modular lattices and affine buildings ⋮ A nonpositive curvature property of modular semilattices ⋮ L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem ⋮ A compact representation for modular semilattices and its applications ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ A Tractable Class of Binary VCSPs via M-Convex Intersection ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings ⋮ A survey of fundamental operations on discrete convex functions of various kinds ⋮ A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
This page was built for publication: L-CONVEXITY ON GRAPH STRUCTURES
