An algorithm for weighted fractional matroid matching

DOI10.1016/j.jctb.2013.05.004zbMath1301.05057arXiv0806.1818OpenAlexW2007980488MaRDI QIDQ463292

Dion C. Gijswijt, Gyula Pap

Publication date: 16 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0806.1818

zbMATH Keywords

algorithmmatroid paritymatroid matchinglattice polytopefractional matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

On the diameter of lattice polytopes ⋮ Minimizing submodular functions on diamonds via generalized fractional matroid matchings ⋮ Stochastic packing integer programs with few queries ⋮ On the complexity of submodular function minimisation on diamonds ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ On matroid parity and matching polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An augmenting path algorithm for linear matroid parity
• Matroid matching and some applications
• Fractional matroid matchings
• Solving the linear matroid parity problem as a sequence of matroid intersection problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complexity of Matroid Property Algorithms
• Matching 2-lattice polyhedra: Finding a maximum vector
• Two-lattice polyhedra: Duality and extreme points

This page was built for publication: An algorithm for weighted fractional matroid matching