A greedy-algorithm characterization of valuated \(\Delta\)-matroids
From MaRDI portal
Publication:1190645
DOI10.1016/0893-9659(91)90075-7zbMath0764.05018OpenAlexW1978390501MaRDI QIDQ1190645
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
Related Items (24)
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 with coefficients ⋮ Note on exchange axioms for valuated matroids and valuated delta-matroids ⋮ Two algorithms for valuated \(\Delta\)-matroids ⋮ Nonintersecting paths, Pfaffians, and \(\Delta\)-matroids ⋮ Efficient optimal equation formulation in lumped power-conserving systems ⋮ 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 ⋮ Isotropical linear spaces and valuated Delta-matroids ⋮ A note on M-convex functions on jump systems ⋮ A `non-additive' characterization of \(\wp\)-adic norms. ⋮ Optimal Matching Forests and Valuated Delta-Matroids ⋮ Hyperconvexity and tight-span theory for diversities ⋮ Induction of M-convex functions by linking systems ⋮ Pfaffian forms and \(\Delta\)-matroids ⋮ Even factors, jump systems, and discrete convexity ⋮ \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids ⋮ A survey of fundamental operations on discrete convex functions of various kinds ⋮ On basic operations related to network induction of discrete convex functions ⋮ Bisubmodular polyhedra, simplicial divisions, and discrete convexity ⋮ \(\Delta\)-matroids with the strong exchange conditions ⋮ A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
Cites Work
- Valuated matroids: A new look at the greedy algorithm
- Some combinatorial properties of discriminants in metric vector spaces
- Duality theory for finite and infinite matroids with coefficients
- Grassmann-Plücker relations and matroids with coefficients
- Greedy algorithm and symmetric matroids
- Optimal assignments in an ordered set: An application of matroid theory
- Unnamed Item
- Unnamed Item
This page was built for publication: A greedy-algorithm characterization of valuated \(\Delta\)-matroids
