A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
Egon BalasDonald L. MillerJoseph F. PeknyPaolo TothPublished in: J. ACM (1991)
Keyphrases
- np hard
- experimental evaluation
- parallel implementation
- dynamic programming
- preprocessing
- learning algorithm
- k means
- detection algorithm
- similarity measure
- objective function
- optimal solution
- times faster
- matching algorithm
- theoretical analysis
- high accuracy
- optimization algorithm
- recognition algorithm
- improved algorithm
- parallel computation
- expectation maximization
- genetic algorithm
- computational cost
- cost function
- significant improvement
- data structure
- linear programming
- worst case
- shortest path
- clustering method
- probabilistic model
- selection algorithm
- computational complexity
- shortest path problem
- depth first search
- multiprocessor systems