The quadratic M-convexity testing problem

DOI10.1016/j.dam.2017.12.004zbMath1398.90104arXiv1704.02836OpenAlexW2609850832MaRDI QIDQ1701120

Yuni Iwamasa

Publication date: 22 February 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.02836

zbMATH Keywords

discrete convex analysisM-convextesting problem

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items (2)

An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint ⋮ A Tractable Class of Binary VCSPs via M-Convex Intersection

Cites Work

• Unnamed Item
• Hybrid tractability of valued constraint problems
• Convexity and Steinitz's exchange property
• Valuated matroids: A new look at the greedy algorithm
• A fast algorithm for constructing trees from distance matrices
• Valuated matroids
• Discrete convexity in joint winner property
• \(M\)-convex functions and tree metrics
• Quadratic M-convex and L-convex functions
• Recent Developments in Discrete Convex Analysis
• Discrete Convex Analysis

This page was built for publication: The quadratic M-convexity testing problem