Greedy algorithms and poset matroids

From MaRDI portal
Publication:473210

DOI10.1016/J.JDA.2014.07.005zbMATH Open1308.68146arXiv1306.3797OpenAlexW2153770200MaRDI QIDQ473210FDOQ473210


Authors: L. Ferrari Edit this on Wikidata


Publication date: 24 November 2014

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

Abstract: We generalize the matroid-theoretic approach to greedy algorithms to the setting of poset matroids, in the sense of Barnabei, Nicoletti and Pezzoli (1998) [BNP]. We illustrate our result by providing a generalization of Kruskal algorithm (which finds a minimum spanning subtree of a weighted graph) to abstract simplicial complexes.


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




Recommendations




Cites Work


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)