Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Edmonds (1970)
Submodular Functions, Matroids and Certain Polyhedra
D. J. A. Welsh (1976)
Matroid Theory
U. Faigle (1980)
Geometries on Partially Ordered Set.J. Comb. Theory, 28
U. Faigle (1979)
The Greedy Algorithm for Partially Ordered SetDiscrete Mathematics, 28
J. Edmonds, R. Giles (1977)
A Min-Max Relation for Submodular Functions on GraphsAnnals of Discrete Mathematics, 1
Greedoids can be viewed as relaxations of matroids. As a subclass, APS-greedoids cover many combinatorial problems. This paper deals with APS-greedoid polyhedra. These polyhedra are similar in properties to matroid polyhedra. That is, the vertices of an APS-greedoid polyhedron are precisely the incidence vectors of the members of an APS-greedoid.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Apr 26, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.