Abstract

We consider a class of submodular functions on distributive lattices that are defined in terms of concave functions and modular functions. The minimization of such a submodular function is made in time required for a max-flow computation on an associated network by means of the parametric max-flow algorithm of Gallo, Grigoriadis and Tarjan. The problem is closely related to the classic majorization and the majorization on posets. As an application of the parametric approach, we improve the time complexity of a capacity scaling algorithm for the submodular flow problem. We also discuss a generalization and its relation to the principal partition or the lexicographically optimal base of a submodular system.

Full Text
Paper version not known

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.