Matching 2-lattice polyhedra: Finding a maximum vector

DOI10.1016/S0012-365X(00)00219-3MaRDI QIDQ5939916zbMATH OpenOpenAlexFDO

Authors Shiow-Yun Chang, Donna C. Leewellyn, John H. Vande Vate

Publication date 23 October 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00219-3

zbMATH Keywords

lattice polyhedra

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Two-lattice polyhedra: Duality and extreme points
• Reducing Matching to Polynomial Size Linear Programming
• scientific article; zbMATH DE number 795216
• Matching Problems in Polymatroids Without Double Circuits
• scientific article; zbMATH DE number 1953187

Cited in

(6)

• Minimizing submodular functions on diamonds via generalized fractional matroid matchings
• An algorithm for weighted fractional matroid matching
• Two-lattice polyhedra: Duality and extreme points
• Algebraic algorithms for fractional linear matroid parity via noncommutative rank
• Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
• Fractional linear matroid matching is in quasi-NC

This page was built for publication: Matching 2-lattice polyhedra: Finding a maximum vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939916)