Abstract

Integer-valued elements of an integral submodular flow polyhedron Q are investigated which are decreasingly minimal (dec-min) in the sense that their largest component is as small as possible, within this, the second largest component is as small as possible, and so on. As a main result, we prove that the set of dec-min integral elements of Q is the set of integral elements of another integral submodular flow polyhedron arising from Q by intersecting a face of Q with a box. Based on this description, we develop a strongly polynomial algorithm for computing not only a dec-min integer-valued submodular flow but even a cheapest one with respect to a linear cost-function. A special case is the problem of finding a strongly connected (or k -edge-connected) orientation of a mixed graph whose in-degree vector is decreasingly minimal.

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.