zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
An exact characterization of greedy structures. (English) Zbl 0798.68061
Summary: The authors present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which are called matroid embeddings, complete the partial characterizations of R. Rado [Note on independent functions, Proc. London Math. Soc., III. Ser. 7, 300-320 (1957; Zbl 0083.023)], D. Gale [Optimal assignments in an ordered set, J. Comb. Theory 4, 176-180 (1968; Zbl 0197.008)], and J. Edmonds [Matroids and the greedy algorithm, Math. Programming 1, 127-136 (1971; Zbl 0253.90027)] (matroids), and of B. Korte and L. Lovasz [Greedoids and linear object functions, SIAM J. Algebraic Discrete Methods 5, 229-238 (1984; Zbl 0538.05027)] and [Mathematical structures underlying greedy algorithms, in Fundamentals of computational theory, Lect. Notes Comput. Sci. 117, 205-209 (1981; Zbl 0473.68019)] (greedoids). It is shown that the greedy algorithm optimizes all linear objective functions if and only if the problem structure (phrased in terms of either accessible set systems or hereditary languages) is a matroid embedding. An exact characterization of the objective functions optimized by the greedy algorithm on matroid embeddings is also presented. Finally, the authors present an exact characterization of the structures on which the greedy algorithm optimizes all bottleneck functions, structures that are less constrained than matroid embeddings.
MSC:
68W10Parallel algorithms
05B35Matroids, geometric lattices (combinatorics)
90C27Combinatorial optimization
68R05Combinatorics in connection with computer science