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

DOI10.1007/BF01935363zbMath0582.05017OpenAlexW2007691782MaRDI QIDQ1068836

Alan M. Frieze, Trevor I. Fenner

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935363

zbMATH Keywords

polynomial time algorithmmatroidsfinding a spanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Generalized Bottleneck Problems^∗ ⋮ Efficient solution of the matroid product problem

Cites Work

• Unnamed Item
• Unnamed Item
• Note on Independence Functions
• Efficient algorithms for a family of matroid intersection problems
• Combinatorial Optimization with Rational Objective Functions
• Minimal ratio spanning trees
• Optimal assignments in an ordered set: An application of matroid theory
• Matroids and the greedy algorithm