Greedoids
From MaRDI portal
Publication:810029
zbMath0733.05023MaRDI QIDQ810029
Bernhard Korte, Rainer Schrader, László Lovász
Publication date: 1991
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Dynamic programming and graph optimization problems, Generating and characterizing the perfect elimination orderings of a chordal graph, On maximin share allocations in matroids, Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions, Convex geometries are extremal for the generalized Sauer-Shelah bound, Counting convex polygons in planar point sets, A greedy algorithm for interval greedoids, Critical sets, crowns and local maximum independent sets, Trees as semilattices, Dual greedy polyhedra, choice functions, and abstract convex geometries, Extreme point axioms for closure spaces, Polluted river problems and games with a permission structure, Well-layered maps---a class of greedily optimizable set functions, On the topology of the free complexes of convex geometries, Pfaffian forms and \(\Delta\)-matroids with coefficients, Sufficient conditions for the optimality of the greedy algorithm in greedoids, Closure lattices, An extended formulation of the convex recoloring problem on a tree, Perspectives of Monge properties in optimization, Matroids on convex geometries (cg-matroids), Compressed representation of learning spaces, Multiple facility location on a network with linear reliability order of edges, A discrete duality between nonmonotonic consequence relations and convex geometries, Gross substitutability: an algorithmic survey, On imposing connectivity constraints in integer programs, Subspace Procrustes analysis, Excluded-minor characterizations of antimatroids arisen from posets and graph searches., Fragmentary structures in discrete optimization problems, The Bhargava greedoid, A greedy algorithm for convex geometries, The forbidden minor characterization of line-search antimatroids of rooted digraphs, Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries, Matroids on convex geometries: subclasses, operations, and optimization, Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings, The presence of lattice theory in discrete problems of mathematical social sciences. Why., Local maximum stable set greedoids stemming from very well-covered graphs, Optimizing phylogenetic diversity under constraints, A system-theoretic model for cooperation, interaction and allocation, Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs, Convexity properties for interior operator games, New polyhedral and algorithmic results on greedoids, On local maximum stable set greedoids, Expected rank in antimatroids, Split decomposition over an Abelian group. I: Generalities, Antimatroids induced by matchings, Network structures with hierarchy and communication, Oriented interval greedoids, Impartial achievement games on convex geometries, Choice resolutions, Algorithms for media, The joy of implications, aka pure Horn formulas: mainly a survey, Interval partitions and activities for the greedoid Tutte polynomial, A convex polytope and an antimatroid for any given, finite group, On the shelling antimatroids of split graphs, A unified interpretation of several combinatorial dualities, A game semantics for system P, On the diameter of tree associahedra, Coordinatization of finite join-distributive lattices., Games with a permission structure -- a survey on generalizations and applications, Closure spaces that are not uniquely generated, Path-independence and closure operators with the anti-exchange property, The affine representation theorem for abstract convex geometries, Monge extensions of cooperation and communication structures, A branching greedoid for multiply-rooted graphs and digraphs, Duality between quasi-concave functions and monotone linkage functions, Strong IP formulations need large coefficients, Characterizations of the convex geometries arising from the double shellings of posets, Interaction indices for games on combinatorial structures with forbidden coalitions, Graph operations that are good for greedoids, Optimum turn-restricted paths, nested compatibility, and optimum convex polygons, Krein-Milman spaces, A greedoid and a matroid inspired by Bhargava's \(p\)-orderings, A Tutte polynomial which distinguishes rooted unicyclic graphs, The complexity of the matroid-greedoid partition problem, Minimum partition of an independence system into independent sets, A disturbed version of the greedy algorithm, Factorisation of greedoid polynomials of rooted digraphs, Expected value expansions in rooted graphs, The \(S\)-digraph optimization problem and the greedy algorithm, Topologically sweeping visibility complexes via pseudotriangulations, Pruning processes and a new characterization of convex geometries, Violator spaces vs closure spaces, Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm, Secretary problem: graphs, matroids and greedoids, Cooperative games on antimatroids, The greedy algorithm and Coxeter matroids, The sorting order on a Coxeter group., Discrete convex analysis, Axiomatizations of the Shapley value for games on augmenting systems, On verifying and engineering the wellgradedness of a union-closed family, Note on two necessary and sufficient axioms for a well-graded knowledge space, Interpolation theorems for graphs, hypergraphs and matroids, A new greedoid: The family of local maximum stable sets of a forest, Injection geometries, Introduction to the combinatorial atlas, Induced layered clusters, hereditary mappings, and convex geometries, Closure systems and their structure, Join-semidistributive lattices and convex geometries., Layered clusters of tightness set functions, Enumerating maximal consistent closed sets in closure systems, Networks, Communication and Hierarchy: Applications to Cooperative Games, On unicyclic graphs with uniquely restricted maximum matchings, Knowledge spaces from a topological point of view, A representation of antimatroids by Horn rules and its application to educational systems, Resolutions of convex geometries, Unnamed Item, CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE, Impartial hypergraph games, Greedoids from flames, Tabling with Sound Answer Subsumption, Tropical Carathéodory with matroids, Reconfiguring (non-spanning) arborescences, Log-concave poset inequalities (extended abstract), Partition coefficients of acyclic graphs, Chordal graphs and their clique graphs, Vertex covering with capacitated trees, Unnamed Item, Antimatroids, Betweenness, Convexity, Forbidden subgraphs and the König-Egerváry property, Antimatroids and balanced pairs, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid, When bad things happen to good trees, Quasi-concave functions on meet-semilattices, The max-flow min-cut property of two-dimensional affine convex geometries, Enumeration in convex geometries and associated polytopal subdivisions of spheres, The duality between the anti-exchange closure operators and the path independent choice operators on a finite set, The computational complexity of antimatroid properties, Mathematics of Plott choice functions, Greedy solutions of selection and ordering problems, The structure of a linear chip firing game and related models, Augmenting and Decreasing Systems, Unnamed Item, Oracles for vertex elimination orderings, Distributive Lattice Polyhedra, Finding a Maximum-Weight Convex Set in a Chordal Graph, The Clique Corona Operation and Greedoids, The chip-firing game, A characteristic polynomial for rooted mixed graphs, The Erdos-Szekeres problem on points in convex position – a survey, Unicycle graphs and uniquely restricted maximum matchings, A Geometric Characterization of Poly-antimatroids, A greedy algorithm for dropping digits
