Abstract
In this chapter we study the class of local poset greedoids. Their name is motivated by the fact that their restrictions to feasible sets are poset antimatroids. These greedoids have the interval property. Local poset greedoids cover a broad range of examples: directed and undirected branchings, poset antimatroids and polymatroid greedoids.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Local Poset Greedoids. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive