Induction of M-convex functions by linking systems
From MaRDI portal
Publication:997074
DOI10.1016/j.dam.2007.03.010zbMath1149.90033OpenAlexW2171578835MaRDI QIDQ997074
Kazuo Murota, Yusuke Kobayashi
Publication date: 19 July 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.010
Related Items
Presentations of transversal valuated matroids, Recent Developments in Discrete Convex Analysis, A proof of Cunningham's conjecture on restricted subgraphs and jump systems, A note on M-convex functions on jump systems, On basic operations related to network induction of discrete convex functions
Cites Work
- Unnamed Item
- Matroids and linking systems
- Convexity and Steinitz's exchange property
- Valuated matroids: A new look at the greedy algorithm
- \(\Delta\)-matroid and jump system
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- Valuated matroids
- Bimatroids and invariants
- \(\Delta\)-matroids with the strong exchange conditions
- The membership problem in jump systems
- A constructive proof for the induction of M-convex functions through networks
- Pfaffian forms and \(\Delta\)-matroids
- Submodular functions and optimization.
- Minconvex Factors of Prescribed Size in Graphs
- Discrete Convex Analysis
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Operations on M‐Convex Functions on Jump Systems
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Independence Spaces and Combinatorial Problems
- Integer Programming and Combinatorial Optimization
- Matrices and matroids for systems analysis
