An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding a matroid basis which maximizes the product of the weights of the elements |
scientific article; zbMATH DE number 3931031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a matroid basis which maximizes the product of the weights of the elements |
scientific article; zbMATH DE number 3931031 |
Statements
An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (English)
0 references
1985
0 references
This paper is devoted to a generalization to matroids of the problem of finding a spanning tree in an edge-weighted connected graph that maximizes the product of the weights of edges, where negative edge weights are allowed. As the main result, a polynomial time algorithm for the solution of this problem in the context of matroids is described.
0 references
finding a spanning tree
0 references
polynomial time algorithm
0 references
matroids
0 references
