Optimal Matching Forests and Valuated Delta-Matroids
From MaRDI portal
Publication:3009779
DOI10.1007/978-3-642-20807-2_32zbMath1341.90119OpenAlexW2185937248MaRDI QIDQ3009779
Publication date: 24 June 2011
Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_32
Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Shortest bibranchings and valuated matroid intersection ⋮ Relationship of two formulations for shortest bibranchings ⋮ Bisubmodular polyhedra, simplicial divisions, and discrete convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings and \(\Delta\)-matroids
- Some combinatorial properties of discriminants in metric vector spaces
- Pseudomatroids
- Generalized polymatroids and submodular flows
- Matroid matching and some applications
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- \(\Delta\)-matroids with the strong exchange conditions
- Pfaffian forms and \(\Delta\)-matroids
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Vizing-type theorem for matching forests
- Greedy algorithm and symmetric matroids
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- Optimum matching forests III: Facets of matching forest polyhedra
- CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
- Discrete Convex Analysis
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- Optimum branchings
- Total dual integrality of matching forest constraints
This page was built for publication: Optimal Matching Forests and Valuated Delta-Matroids
