A Simple Minimum T-Cut Algorithm

Rizzi, Romeo (2002) A Simple Minimum T-Cut Algorithm. UNSPECIFIED.

Download (194Kb) | Preview


    We give a simple algorithm for finding a minimum T-cut. At present, all known efficient algorithms for this problem go through the computation of a Gomory-Hu tree. While our algorithm bases on the same fundamental properties of uncrossing as the previous methods, still it provides an ad-hoc solution. This solution is easier to implement and faster to run. Our results extend to the whole of symmetric submodular 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: T-cut, minimum T-cut, T-pairing, Gomory-Hu tree
    Additional Information: Published: will appear on Discrete Applied Mathematics
    Report Number: DIT-02-104
    Repository staff approval on: 29 Jan 2003

    Actions (login required)

    View Item