Abstract

Edmonds and Giles [1] discuss functions on the arcs of a digraph satisfying submodular set constraints. We call such functions submodular flows, show that the difference of group-valued submodular flows is a network circulation in a certain auxiliary digraph, and derive a criterion for the existence of group-valued submodular flows. We develop a method for maximizing the value of a group-valued submodular flow in a specified arc and a negative circuit method for minimizing certain functions on ring-valued submodular flows. In particular, algebraic linear functions over modules and certain semimodules as well as quotients of linear functions over totally ordered, commutative fields can be minimized.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.