Induction of M-convex functions by linking systems
From MaRDI portal
(Redirected from Publication:997074)
Recommendations
Cites work
- scientific article; zbMATH DE number 3600054 (Why is no real title available?)
- A constructive proof for the induction of M-convex functions through networks
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- Bimatroids and invariants
- Convexity and Steinitz's exchange property
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Discrete Convex Analysis
- Independence Spaces and Combinatorial Problems
- Integer Programming and Combinatorial Optimization
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Matrices and matroids for systems analysis
- Matroids and linking systems
- Minconvex Factors of Prescribed Size in Graphs
- Operations on M‐Convex Functions on Jump Systems
- Pfaffian forms and \(\Delta\)-matroids
- Submodular functions and optimization.
- The membership problem in jump systems
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
- \(\Delta\)-matroid and jump system
- \(\Delta\)-matroids with the strong exchange conditions
Cited in
(6)- Recent developments in discrete convex analysis
- On basic operations related to network induction of discrete convex functions
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Presentations of transversal valuated matroids
- A note on M-convex functions on jump systems
This page was built for publication: Induction of M-convex functions by linking systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997074)
