The Exact Bipartite Matching Polytope Has Exponential Extension Complexity.

Xinrui Jia Ola Svensson Weiqiang Yuan

Published in: CoRR (2022)

Keyphrases

bipartite matching
maximum weight
lattice points
minimum cost flow
bayesian networks
computational complexity
worst case
knapsack problem