A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs.
Nathaniel LahnSharath RaghvendraPublished in: CoRR (2018)
Keyphrases
- np hard
- minimum cost
- bipartite matching
- minimum cost flow
- spanning tree
- undirected graph
- dynamic programming
- network flow
- optimal solution
- worst case
- linear programming
- particle swarm optimization
- ant colony optimization
- path planning
- approximation algorithms
- graph partitioning
- shortest path problem
- minimum spanning tree
- edit operations
- search space