BIROn - Birkbeck Institutional Research Online

    An algorithm for finding a matroid basis which maximizes the products of the weights of the elements

    Fenner, Trevor and Frieze, A.M. (1985) An algorithm for finding a matroid basis which maximizes the products of the weights of the elements. BIT Numerical Mathematics 25 (3), pp. 433-438. ISSN 0006-3835.

    Full text not available from this repository.

    Abstract

    Consider the problem of finding a spanning tree in an edge-weighted connected graph that maximizes the product of its edge weights, where negative edge weights are allowed. We generalize this problem to matroids and give a polynomial time algorithm for its solution.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 22 Mar 2021 20:37
    Last Modified: 22 Mar 2021 20:37
    URI: https://eprints.bbk.ac.uk/id/eprint/43623

    Statistics

    Downloads
    Activity Overview
    0Downloads
    22Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item