Valuated matroids: A new look at the greedy algorithm. (English) Zbl 0701.05014
Summary: In this note we study a variant of the greedy algorithm for weight functions defined on the system of m-subsets of a given set E and characterize completely those classes of weight function for which this algorithm works. Well-known examples come from matroid theory; new ones come from valuation theory.
MSC:
| 05B35 | Combinatorial aspects of matroids and geometric lattices |
References:
| [1] | A.W.M. Dress and W. Wenzel, Valuated matroids; A.W.M. Dress and W. Wenzel, Valuated matroids |
| [2] | Gale, D., Optimal assignments in an ordered set: An application of matroid theory, Journal of Combinatorial Theory, 4, 176-180 (1968) · Zbl 0197.00803 |
| [3] | B. Korte, L. Lovász and R. Schrader, “Greedoid Theory,” Algorithms and Combinatorics 4, Springer-Verlag (to appear).; B. Korte, L. Lovász and R. Schrader, “Greedoid Theory,” Algorithms and Combinatorics 4, Springer-Verlag (to appear). |
| [4] | Kruskal, J. B., On the shortest spanning subgraph of a graph and the travelling salesman problem, Proc. Amer. Math. Soc., 7, 48-49 (1956) · Zbl 0070.18404 |
| [5] | Rado, R., Note on independence functions, Proc. London Math. Soc., 7, 300-320 (1957) · Zbl 0083.02302 |
| [6] | Whitney, H., On the abstract properties of linear dependence, Amer. J. Math., 57, 509-533 (1935) · JFM 61.0073.03 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
