Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem.
Yingli RanZhao ZhangShaojie TangPublished in: COLT (2022)
Keyphrases
- parallel algorithm
- minimum cost
- np hard
- approximation algorithms
- spanning tree
- parallel computation
- network flow
- network simplex algorithm
- capacity constraints
- parallel programming
- network flow problem
- parallel implementations
- cluster of workstations
- binary search trees
- shared memory
- linear programming
- data structure
- medial axis transform
- dominant points
- discovery of association rules
- linear program
- scheduling problem
- minimum cost flow
- objective function