Comments on bases in dependence structures
From MaRDI portal
Publication:5560302
Cites work
Cited in
(72)- Arbres minimaux d'un graphe preordonne
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
- Matrix methods in decompositions of modules
- A unique exchange property for bases
- The dependence graph for bases in matroids
- An independence structure on indecomposable modules
- Matroids on partially ordered sets
- On matroids without a non-Fano minor
- Compatible systems of representatives
- Adjacency, inseparability, and base orderability in matroids
- On maximin share allocations in matroids
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Collapsible subgraphs of a 4-edge-connected graph
- Triangulations intersect nicely
- The excluded minors for GF(4)-representable matroids
- Matroid optimization problems with monotone monomials in the objective
- Products of polymatroids with the strong exchange property
- Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Tropical Kirchhoff's formula and postoptimality in matroid optimization
- Some properties of basic families of subsets
- Popular matchings with two-sided preference lists and matroid constraints
- Approximate tradeoffs on weighted labeled matroids
- The power of randomness in Bayesian optimal mechanism design
- List coloring of matroids and base exchange properties
- Finding socially best spanning treesî
- The price of imperfect competition for a spanning network
- Inequalities on submodular functions via term rewriting
- On the toric ideal of a matroid
- On Rota's conjecture and excluded minors containing large projective geometries.
- On matroids with multiple objectives
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Incremental network design with minimum spanning trees
- Matroid toric ideals: complete intersection, minors, and minimal systems of generators
- Decomposing symmetric exchanges in matroid bases
- Coverings and delta-coverings
- An improved analysis of local search for max-sum diversification
- On the construction of substitutes
- Obstructions for bounded branch-depth in matroids
- On sequential basis exchange in matroids
- Pareto stable matchings under one-sided matroid constraints
- Approximate maximin share allocations in matroids
- Induced Matroids
- Flip distances between graph orientations
- Characterizations of transversal matroids and their presentations
- Characterizations of transversal matroids and their presentations
- Algorithms for maximizing monotone submodular function minus modular function under noise
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Biobjective optimization problems on matroids with binary costs
- On Fair Division under Heterogeneous Matroid Constraints
- 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
- Partitioning bispanning graphs into spanning trees
- Solving the maximum popular matching problem with matroid constraints
- Greedy heuristic guided by lexicographic excellence
- Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
- Problems on group-labeled matroid bases
- On approximately Cohen-Macaulay property of symbolic powers of a square-free monomial ideal
- Tropical toric maximum likelihood estimation
- A fast algorithm for submodular maximization with a matroid constraint
- Popular arborescences and their matroid generalization
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- On the congruency-constrained matroid base
- Price of anarchy in paving matroid congestion games
- The fairness of maximum Nash social welfare under matroid constraints and beyond
- An accelerated continuous greedy algorithm for maximizing strong submodular functions
- An infinite family of excluded minors for strong base-orderability
- Matchings and \(\Delta\)-matroids
This page was built for publication: Comments on bases in dependence structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560302)
