Greedy Families for Linear Objective Functions

DOI10.1002/sapm1991843221zbMath0753.05020OpenAlexW2508194713MaRDI QIDQ3970969

Thomas H. Brylawski

Publication date: 25 June 1992

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm1991843221

zbMATH Keywords

greedy algorithmlinear objective functionsbases of a matroidalgorithms of Kruskal, Prim, and Dijkstragreedy familiesoptimum subset

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Exchange systems

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The greedy algorithm for partially ordered sets
• Majors of geometric strong maps
• Exchange systems
• Greedoids and Linear Objective Functions
• OPTIMAL MATROID BASES: AN ALGORITHM BASED ON COCIRCUITS
• Matroids and the greedy algorithm
• Theory of Matroids