A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs.
Nathaniel LahnSharath RaghvendraPublished in: SODA (2019)
Keyphrases
- minimum cost
- np hard
- spanning tree
- minimum cost flow
- bipartite matching
- dynamic programming
- minimum spanning tree
- objective function
- undirected graph
- optimal solution
- network flow problem
- particle swarm optimization
- simulated annealing
- weighted graph
- shortest path
- linear programming
- network flow
- worst case
- search space
- computational complexity