zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Greedoids. (English) Zbl 0733.05023
Algorithms and Combinatorics, 4. Berlin etc.: Springer-Verlag. viii, 211 p. 17 fig. DM 128.00 (1991).

Matroids can be characterized by the greedy algorithms. The maximum weight feasible sets of a set system F (provided F; and XF and YX implies YF) are found by the greedy algorithm for every weight function if and only if F is the collection of independent sets of a matroid. A more general concept, greedoids, can be obtained if only “reasonable” weight functions are considered (where for x 0 AB if x 0 is optimal among every x with A{x} feasible then x 0 is also optimal among every x with B{x} feasible).

Alternatively, a greedoid is a set system where every subset of a feasible set need not be feasible but the empty set must be reachable from every feasible set through feasible sets by single element deletions.

Thus greedoids are generalizations of matroids, and, at the same time, of “antimatroids” (arising from ideals of posets, from scheduling problems with alternative posets, from scheduling problems with alternative precedence constraints) and many other combinatorial structures related to algorithms and decomposition procedures (like Gaussian elimination, matching algorithms, ear-decompositions of graphs, perfect elimination schemes etc).

The present volume - the first monograph of greedoids - introduces matroids, antimatroids and greedoids in the first 4 chapters. The next 2 chapters are devoted to the structural properties of greedoids. Chapters VII through X deal with special classes of greedoids while optimization and topological aspects are covered in the last two chapters.

The bibliography contains some 140 titles. About 50 of them explicitly deal with greedoids, more than 20 are authored or coauthored by one or more of the presents authors, who introduced the concept and performed most of the research on greedoids. This self-contained volume can warmly be recommended to all scientists interested in algorithmic aspects of mathematics and computer science.

Reviewer: A.Recski

05B35Matroids, geometric lattices (combinatorics)
05-02Research monographs (combinatorics)