A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows.
Andrzej LingasMia PerssonPublished in: Algorithmica (2015)
Keyphrases
- parallel algorithm
- minimum cost
- np hard
- approximation algorithms
- network flow
- parallel computation
- capacity constraints
- network flow problem
- spanning tree
- minimum cost flow
- network simplex algorithm
- shared memory
- parallel programming
- cluster of workstations
- parallel implementations
- parallel version
- processor array
- binary search trees
- worst case
- lower bound
- data structure