Induction of M-convex functions by linking systems
From MaRDI portal
Publication:997074
DOI10.1016/J.DAM.2007.03.010zbMATH Open1149.90033OpenAlexW2171578835MaRDI QIDQ997074FDOQ997074
Authors: Yusuke Kobayashi, Kazuo Murota 
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
Recommendations
Cites Work
- Discrete Convex Analysis
- Submodular functions and optimization.
- Minconvex Factors of Prescribed Size in Graphs
- Matrices and matroids for systems analysis
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Valuated matroids
- The membership problem in jump systems
- Operations on M‐Convex Functions on Jump Systems
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Integer Programming and Combinatorial Optimization
- Convexity and Steinitz's exchange property
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- \(\Delta\)-matroids with the strong exchange conditions
- Pfaffian forms and \(\Delta\)-matroids
- Valuated matroids: A new look at the greedy algorithm
- \(\Delta\)-matroid and jump system
- Independence Spaces and Combinatorial Problems
- Matroids and linking systems
- Title not available (Why is that?)
- Bimatroids and invariants
- A constructive proof for the induction of M-convex functions through networks
Cited In (6)
- Presentations of transversal valuated matroids
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- A note on M-convex functions on jump systems
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra
- On basic operations related to network induction of discrete convex functions
- Recent developments in discrete convex analysis
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)
