High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem.
Jerry Lacmou ZeutouoVianney Kengne TchendjiJean Frédéric MyoupoPublished in: J. Supercomput. (2022)
Keyphrases
- minimum cost
- parallel algorithm
- pc cluster
- parallel computers
- np hard
- approximation algorithms
- network flow
- network flow problem
- parallel computation
- shared memory
- parallel programming
- capacity constraints
- spanning tree
- minimum cost flow
- network simplex algorithm
- combinatorial search problems
- distributed memory
- parallel implementations
- discovery of association rules
- data structure
- special case