Greedy algorithms and poset matroids

DOI10.1016/j.jda.2014.07.005zbMath1308.68146arXiv1306.3797OpenAlexW2153770200MaRDI QIDQ473210

Luca Ferrari

Publication date: 24 November 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3797

zbMATH Keywords

posetgreedy algorithmmatroidabstract simplicial complex

Mathematics Subject Classification ID

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

Related Items

Generalized matroids based on three-way decision models

Cites Work

• Unnamed Item
• Unnamed Item
• A general model for matroids and the greedy algorithm
• The greedy algorithm for partially ordered sets
• Geometries on partially ordered sets
• Matroids on partially ordered sets
• On ordered languages and the optimization of linear functions by greedy algorithms
• Matroids and the greedy algorithm
• A THEOREM ON INDEPENDENCE RELATIONS