scientific article; zbMATH DE number 4047093

MaRDI QIDQ3783556zbMATH OpenFDO

Authors László Lovász

Publication date 1986

zbMATH Keywords

algorithmic complexityperfect matching latticesseparation oracleseparation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Recommendations

• The Generalized Basis Reduction Algorithm
• scientific article; zbMATH DE number 3908520
• scientific article; zbMATH DE number 863488
• A hierarchy of polynomial time lattice basis reduction algorithms
• scientific article; zbMATH DE number 4029654

Cited in

(9)

• Matching structure and the matching lattice
• The 2-matching lattice of a graph
• A note on the \(f\)-factor-lattice of bipartite graphs
• The cocycle lattice of binary matroids. II
• Generating bricks
• Lattice problems in NP ∩ coNP
• Algorithms for k-meet-semidistributive lattices
• Problems on group-labeled matroid bases
• Attacking the market split problem with lattice point enumeration

This page was built for publication:

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