A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows.
Andrzej LingasMia PerssonPublished in: Euro-Par (2012)
Keyphrases
- parallel algorithm
- minimum cost
- np hard
- approximation algorithms
- network flow
- spanning tree
- parallel computation
- shared memory
- parallel programming
- network flow problem
- cluster of workstations
- parallel implementations
- capacity constraints
- network simplex algorithm
- medial axis transform
- discovery of association rules
- special case
- binary search trees
- parallel version
- linear programming
- search algorithm
- network design problem
- integer programming