scientific article
From MaRDI portal
Publication:3338268
zbMath0547.05025MaRDI QIDQ3338268
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A framework for the greedy algorithm, The 2-quasi-greedy algorithm for cardinality constrained matroid bases, Non-interval greedoids and the transposition property, Exchange properties of combinatorial closure spaces, Homotopy properties of greedoids, A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids, An algorithmic characterization of antimatroids, A characterization of undirected branching greedoids, Homomorphisms and Ramsey properties of antimatroids, A circuit set characterization of antimatroids, Directed submodularity, ditroids and directed submodular flows, Sufficient conditions for the optimality of the greedy algorithm in greedoids, Categories of \((I, I)\)-fuzzy greedoids, Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid, Advice complexity of adaptive priority algorithms, The forbidden minor characterization of line-search antimatroids of rooted digraphs, New polyhedral and algorithmic results on greedoids, Greedoids and searches in directed graphs, Polymatroid greedoids, Greedy solutions of selection and ordering problems, The intersection of matroids and antimatroids, A remark on perfect Gaussian elimination of symmetric matrices, Factorisation of greedoid polynomials of rooted digraphs, Minor characterization of undirected branching greedoids -- a short proof, Matroids and antimatroids - a survey, Exchange systems, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, The Erdos-Szekeres problem on points in convex position – a survey, A note on selectors and greedoids, An intersection theorem for supermatroids, A unifying approach to the structures of the stable matching problems, Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
