A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem.
Jaime GonzalezOsvaldo LandaetaPublished in: SIAM J. Discret. Math. (1995)
Keyphrases
- spanning tree
- minimum spanning tree
- optimal solution
- minimum weight
- dynamic programming
- np hard
- probabilistic model
- segmentation algorithm
- tree structure
- computational complexity
- social networks
- simulated annealing
- particle swarm optimization
- optimization algorithm
- combinatorial optimization
- knapsack problem
- multi objective
- greedy heuristic