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.

Official URL: https://doi.org/10.1007/BF01935363

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:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	22 Mar 2021 20:37
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43623

Statistics

Archive Staff Only (login required)