Optimal Matching Forests and Valuated Delta-Matroids
Publication:3009779
DOI10.1007/978-3-642-20807-2_32zbMATH Open1341.90119OpenAlexW2185937248MaRDI QIDQ3009779FDOQ3009779
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) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete Convex Analysis
- Paths, Trees, and Flowers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Maximum matching and a polyhedron with 0,1-vertices
- Optimum branchings
- Generalized polymatroids and submodular flows
- Matroid matching and some applications
- Greedy algorithm and symmetric matroids
- Pseudomatroids
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- \(\Delta\)-matroids with the strong exchange conditions
- Pfaffian forms and \(\Delta\)-matroids
- Some combinatorial properties of discriminants in metric vector spaces
- CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
- Total dual integrality of matching forest constraints
- Matchings and \(\Delta\)-matroids
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- Optimum matching forests III: Facets of matching forest polyhedra
- A Vizing-type theorem for matching forests
Cited In (4)
This page was built for publication: Optimal Matching Forests and Valuated Delta-Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009779)
