A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs.
Mudabir Kabir AsathullaSanjeev KhannaNathaniel LahnSharath RaghvendraPublished in: ACM Trans. Algorithms (2020)
Keyphrases
- minimum cost
- np hard
- matching algorithm
- undirected graph
- planar graphs
- computational complexity
- network flow
- dynamic programming
- probabilistic model
- spanning tree
- similarity measure
- image matching
- network flow problem
- linear programming
- ant colony optimization
- traveling salesman problem
- bayesian framework
- knapsack problem
- worst case
- special case
- lower and upper bounds
- optimal solution
- minimum spanning tree
- binary variables
- objective function
- bayesian networks