Login / Signup
An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem.
Vianney Kengne Tchendji
Jean Frédéric Myoupo
Published in:
J. Supercomput. (2012)
Keyphrases
</>
minimum cost
np hard
computational complexity
network flow problem
dynamic programming
hardware implementation
spanning tree
network flow
minimum cost flow
objective function
scheduling problem
path planning
approximation algorithms
edit operations
coarse grain
network simplex algorithm