Comments on bases in dependence structures
From MaRDI portal
Publication:5560302
DOI10.1017/S000497270004140XzbMath0172.30703OpenAlexW2118947995MaRDI QIDQ5560302
Publication date: 1969
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s000497270004140x
Related Items
Approximate Maximin Share Allocations in Matroids, Compatible systems of representatives, On maximin share allocations in matroids, Uniqueness of equilibria in atomic splittable polymatroid congestion games, Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators, Matroid optimisation problems with nested non-linear monomials in the objective function, Result diversification by multi-objective evolutionary algorithms with theoretical guarantees, Maximizing a non-decreasing non-submodular function subject to various types of constraints, An accelerated continuous greedy algorithm for maximizing strong submodular functions, Algorithms for maximizing monotone submodular function minus modular function under noise, Coverings and delta-coverings, On Packing Dijoins in Digraphs and Weighted Digraphs, Matrix methods in decompositions of modules, An infinite family of excluded minors for strong base-orderability, An Improved Analysis of Local Search for Max-Sum Diversification, On the Construction of Substitutes, Biobjective optimization problems on matroids with binary costs, On Fair Division under Heterogeneous Matroid Constraints, Partitioning bispanning graphs into spanning trees, Partitioning into common independent sets via relaxing strongly base orderability, Matroid Intersection under Restricted Oracles, Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise, Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid, Finding socially best spanning treesî, A unique exchange property for bases, Incremental Network Design with Minimum Spanning Trees, The price of imperfect competition for a spanning network, Matchings and \(\Delta\)-matroids, Inequalities on submodular functions via term rewriting, Tropical Kirchhoff's formula and postoptimality in matroid optimization, On the toric ideal of a matroid, Induced Matroids, Collapsible subgraphs of a 4-edge-connected graph, Obstructions for Bounded Branch-depth in Matroids, On Sequential Basis Exchange in Matroids, Decomposing symmetric exchanges in matroid bases, Some properties of basic families of subsets, On Rota's conjecture and excluded minors containing large projective geometries., On matroids with multiple objectives, The dependence graph for bases in matroids, Popular matchings with two-sided preference lists and matroid constraints, An independence structure on indecomposable modules, Flip distances between graph orientations, Triangulations intersect nicely, Matroids on partially ordered sets, Characterizations of transversal matroids and their presentations, Matroid optimization problems with monotone monomials in the objective, Pareto Stable Matchings under One-Sided Matroid Constraints, Products of polymatroids with the strong exchange property, Adjacency, inseparability, and base orderability in matroids, Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games, On matroids without a non-Fano minor, Arbres minimaux d'un graphe preordonne, The excluded minors for GF(4)-representable matroids, Approximate tradeoffs on weighted labeled matroids, The power of randomness in Bayesian optimal mechanism design, List coloring of matroids and base exchange properties, A characterization of the ternary matroids with no \(M(K_ 4)\)-minor, Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property, Characterizations of transversal matroids and their presentations
Cites Work
