On minimizing symmetric set functions

Rizzi, Romeo (1999) On minimizing symmetric set functions. UNSPECIFIED.

Download (225Kb) | Preview


    Mader proved that every loopless undirected graph contains a pair (u,v) of nodes such that the star of v is a minimum cut separating u and v. Nagamochi and Ibaraki showed that the last two nodes of a "max-back order" form such a pair and used this fact to develop an elegant min-cut algorithm. M. Queyranne extended this approach to minimize symmetric submodular functions. With the help of a short and simple proof, here we show that the same algorithm works for an even more general class of set functions.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: max-back order, minimum cut, symmetric submodular functions
    Additional Information: Published in: "Combinatorica" vol. 20 (3) (2000) 445--450.
    Report Number: DIT-02-055
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    View Item