Matching 2-lattice polyhedra: Finding a maximum vector

DOI10.1016/S0012-365X(00)00219-3zbMath0995.68146OpenAlexW1979556948MaRDI QIDQ5939916

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

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

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

Related Items (2)

Minimizing submodular functions on diamonds via generalized fractional matroid matchings ⋮ An algorithm for weighted fractional matroid matching

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