Abstract
Now we introduce greedoids. They can be described as hereditary languages satisfying an ordered version of the Steinitz exchange property of matroids, or as set systems, which are not necessarily independence systems but satisfy the Steinitz exchange property.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Korte, B., Schrader, R., Lovász, L. (1991). General Exchange Structures — Greedoids. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive