Greedy algorithms and poset matroids
Combinatorics
2013-06-18 v1 Data Structures and Algorithms
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.
Keywords
Cite
@article{arxiv.1306.3797,
title = {Greedy algorithms and poset matroids},
author = {Luca Ferrari},
journal= {arXiv preprint arXiv:1306.3797},
year = {2013}
}