Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid

DOI10.17951/AI.2016.16.2.48MaRDI QIDQ6135742zbMATH OpenFDO

Authors

Publication date 26 August 2023

Published in Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica (Search for Journal in Brave)

zbMATH Keywords

contractiongreedy algorithmsindependence matroid

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• On the generality of the greedy algorithm for solving matroid base problems
• A framework for the greedy algorithm
• Fuzzy matroids and a greedy algorithm
• scientific article; zbMATH DE number 169611
• A class of greedy algorithms and its relation to greedoids

Cites work

• scientific article; zbMATH DE number 3871387 (Why is no real title available?)
• scientific article; zbMATH DE number 5542186 (Why is no real title available?)
• scientific article; zbMATH DE number 3742601 (Why is no real title available?)
• Structural properties of greedoids

This page was built for publication: Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135742)