A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Discrete Convex Functions on Graphs and Their Algorithmic Applications
[article]
2017
arXiv
pre-print
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems.
arXiv:1706.09106v2
fatcat:eqzvcv7cnrguznp4lkdjvz3tfm