Two algorithms for valuated \(\Delta\)-matroids

DOI10.1016/0893-9659(96)00034-1zbMath0854.05022OpenAlexW2132181398MaRDI QIDQ1921193

Kazuo Murota

Publication date: 5 January 1997

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(96)00034-1

zbMATH Keywords

algorithmsprincipal minorvalued \(\Delta\)-matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Note on exchange axioms for valuated matroids and valuated delta-matroids

Cites Work

• Valuated matroids: A new look at the greedy algorithm
• Matchings and \(\Delta\)-matroids
• Pseudomatroids
• A greedy-algorithm characterization of valuated \(\Delta\)-matroids
• \(\Delta\)-matroids with the strong exchange conditions
• Pfaffian forms and \(\Delta\)-matroids
• Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions
• Finding optimal minors of valuated bimatroids
• Well-layered maps---a class of greedily optimizable set functions
• Rewarding maps: On greedy optimization of set functions
• Valuated Matroid Intersection I: Optimality Criteria
• Valuated Matroid Intersection II: Algorithms
• Computing the Degree of Determinants via Combinatorial Relaxation