Note on Independence Functions
From MaRDI portal
Publication:3255413
DOI10.1112/plms/s3-7.1.300zbMath0083.02302OpenAlexW2111741734WikidataQ105914201 ScholiaQ105914201MaRDI QIDQ3255413
Publication date: 1957
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-7.1.300
Related Items
Minimal dependent sets, Von Staudt constructions for skew-linear and multilinear matroids, On Dowling geometries of infinite groups, The Kazhdan-Lusztig polynomial of a matroid, Evolutionary algorithms and matroid optimization problems, Matroid representation of clique complexes, A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids, Formal barriers to simple algorithms for the matroid secretary problem, Improving the linear programming technique in the search for lower bounds in secret sharing, Infinite Matroids, The incidence structure of subspaces with well-scaled frames, Generalized polymatroids and submodular flows, Revised Greedy algorithm for formation of a minimal cycle basis of a graph, Modularity and greed in double auctions, Computing knapsack solutions with cardinality robustness, Constructing Prime-Field Planar Configurations, Problems on independence systems solvable by the greedy algorithm, The greedy algorithm for partially ordered sets, An algorithm to compute the set of characteristics of a system of polynomial equations over the integers., A new greedy algorithm for the quadratic assignment problem, Characteristic sets of matroids, Discrete extremal problems, Matroids and the greedy algorithm, A greedy algorithm for solving a certain class of linear programmes, Representability of matroids by \(c\)-arrangements is undecidable, Combinatorial geometries representable over GF(3) and GF(q). I: The number of points, Hereditary systems and greedy-type algorithms., Valuated matroids: A new look at the greedy algorithm, A greedy algorithm for some classes of integer programs., Secret sharing on regular bipartite access structures, Approximating the least core value and least core of cooperative games with supermodular costs, Finite prime-field characteristic sets for planar configurations, Common information, matroid representation, and secret sharing for matroid ports, The free product of M-fuzzifying matroids1, The templates for some classes of quaternary matroids, Unnamed Item, On the diameter of convex polytopes, The algebraic geometry of Kazhdan-Lusztig-Stanley polynomials, [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Lifts of matroid representations over partial fields, Randomized priority algorithms, A greedy algorithm for maximizing a linear objective function, The excluded minors for the class of matroids that are binary or ternary, On the unique representability of spikes over prime fields, The basis monomial ring of a matroid, Robust Independence Systems, Bimatroids and invariants, Reciprocity in matroid lattices, A disturbed version of the greedy algorithm, Applications of Menger's graph theorem, The \(S\)-digraph optimization problem and the greedy algorithm, Uniformität des Verbandes der Partitionen, An analysis of the greedy algorithm for the submodular set covering problem, Pfaffian structures and critical problems in finite symplectic spaces, A greedy algorithm for finding maximum spanning trees in infinite graphs, An algorithm for finding a matroid basis which maximizes the product of the weights of the elements, Pairwise kidney exchange, Algebraic characteristic sets of matroids, General bounds for incremental maximization
