Greedy algorithms and poset matroids
DOI10.1016/J.JDA.2014.07.005zbMATH Open1308.68146arXiv1306.3797OpenAlexW2153770200MaRDI QIDQ473210FDOQ473210
Authors: L. 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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- A THEOREM ON INDEPENDENCE RELATIONS
- Matroids and the greedy algorithm
- Matroids on partially ordered sets
- A general model for matroids and the greedy algorithm
- The greedy algorithm for partially ordered sets
- Geometries on partially ordered sets
- On ordered languages and the optimization of linear functions by greedy algorithms
Cited In (3)
This page was built for publication: Greedy algorithms and poset matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473210)