A greedy-algorithm characterization of valuated -matroids
From MaRDI portal
Publication:1190645
DOI10.1016/0893-9659(91)90075-7zbMATH Open0764.05018OpenAlexW1978390501MaRDI QIDQ1190645FDOQ1190645
Authors: Walter Wenzel, Andreas W. M. Dress
Publication date: 26 September 1992
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0893-9659(91)90075-7
Recommendations
Cites Work
- Title not available (Why is that?)
- Greedy algorithm and symmetric matroids
- Optimal assignments in an ordered set: An application of matroid theory
- Duality theory for finite and infinite matroids with coefficients
- Grassmann-Plücker relations and matroids with coefficients
- Valuated matroids: A new look at the greedy algorithm
- Some combinatorial properties of discriminants in metric vector spaces
- Title not available (Why is that?)
Cited In (28)
- Nonintersecting paths, Pfaffians, and \(\Delta\)-matroids
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- A note on M-convex functions on jump systems
- Weakly greedy algorithm and pair-Delta-matroids
- Valuated matroids: A new look at the greedy algorithm
- Efficient optimal equation formulation in lumped power-conserving systems
- \(\Delta\)-matroids with the strong exchange conditions
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions
- Well-layered maps---a class of greedily optimizable set functions
- Pfaffian forms and \(\Delta\)-matroids
- Optimal matching forests and valuated delta-matroids
- Induction of M-convex functions by linking systems
- Pfaffian forms and \(\Delta\)-matroids with coefficients
- Two algorithms for valuated \(\Delta\)-matroids
- CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
- Even factors, jump systems, and discrete convexity
- Hyperconvexity and tight-span theory for diversities
- On basic operations related to network induction of discrete convex functions
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Valuated matroids -- a new look at the greedy algorithm
- A `non-additive' characterization of \(\wp\)-adic norms.
- A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
- A survey of fundamental operations on discrete convex functions of various kinds
- Note on exchange axioms for valuated matroids and valuated delta-matroids
- Isotropical linear spaces and valuated Delta-matroids
This page was built for publication: A greedy-algorithm characterization of valuated \(\Delta\)-matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190645)