A fast parallel algorithm for minimum-cost small integral flows
Andrzej LingasMia PerssonPublished in: CoRR (2012)
Keyphrases
- parallel algorithm
- minimum cost
- np hard
- approximation algorithms
- network flow
- parallel computation
- network flow problem
- spanning tree
- capacity constraints
- shared memory
- parallel programming
- cluster of workstations
- network simplex algorithm
- parallel implementations
- parallel version
- binary search trees
- special case
- medial axis transform
- minimum cost flow
- discovery of association rules
- data structure